/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:51:37,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:51:37,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:51:37,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:51:37,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:51:37,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:51:37,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:51:37,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:51:37,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:51:37,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:51:37,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:51:37,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:51:37,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:51:37,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:51:37,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:51:37,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:51:37,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:51:37,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:51:37,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:51:37,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:51:37,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:51:37,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:51:37,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:51:37,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:51:37,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:51:37,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:51:37,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:51:37,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:51:37,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:51:37,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:51:37,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:51:37,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:51:37,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:51:37,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:51:37,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:51:37,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:51:37,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:51:37,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:51:37,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:51:37,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:51:37,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:51:37,785 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:51:37,799 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:51:37,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:51:37,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:51:37,801 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:51:37,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:51:37,801 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:51:37,801 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:51:37,802 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:51:37,802 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:51:37,802 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:51:37,802 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:51:37,802 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:51:37,803 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:51:37,803 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:51:37,803 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:51:37,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:51:37,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:51:37,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:51:37,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:51:37,804 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:51:37,804 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:51:37,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:51:37,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:51:37,805 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:51:37,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:51:37,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:51:37,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:51:37,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:51:37,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:51:37,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:51:37,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:51:37,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:51:37,994 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:51:37,995 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:51:37,996 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:51:38,066 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_juojoJ/tmp/48245d99ff284ede86d358c6646e038f/FLAGf8d7d48fb [2020-07-01 12:51:38,403 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:51:38,404 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:51:38,404 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:51:38,411 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_juojoJ/tmp/48245d99ff284ede86d358c6646e038f/FLAGf8d7d48fb [2020-07-01 12:51:38,797 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_juojoJ/tmp/48245d99ff284ede86d358c6646e038f [2020-07-01 12:51:38,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:51:38,810 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:51:38,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:51:38,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:51:38,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:51:38,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b68b682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38, skipping insertion in model container [2020-07-01 12:51:38,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:51:38,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:51:39,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:51:39,094 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:51:39,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:51:39,126 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:51:39,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39 WrapperNode [2020-07-01 12:51:39,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:51:39,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:51:39,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:51:39,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:51:39,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:51:39,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:51:39,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:51:39,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:51:39,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:51:39,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:51:39,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:51:39,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:51:39,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:51:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:51:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:51:39,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:51:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:51:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:51:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:51:39,487 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:51:39,488 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:51:39,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39 BoogieIcfgContainer [2020-07-01 12:51:39,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:51:39,492 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:51:39,492 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:51:39,494 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:51:39,495 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,509 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 21 edges [2020-07-01 12:51:39,510 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:51:39,511 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:51:39,512 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:51:39,512 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:51:39,514 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:51:39,514 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:51:39,515 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:51:39,535 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:51:39,559 INFO L200 BlockEncoder]: SBE split 9 edges [2020-07-01 12:51:39,564 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:51:39,566 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:51:39,583 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 12:51:39,586 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-07-01 12:51:39,588 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:51:39,588 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:51:39,588 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:51:39,589 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:51:39,589 INFO L313 BlockEncoder]: Encoded RCFG 13 locations, 21 edges [2020-07-01 12:51:39,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39 BasicIcfg [2020-07-01 12:51:39,590 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:51:39,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:51:39,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:51:39,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:51:39,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:51:38" (1/4) ... [2020-07-01 12:51:39,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11621a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (2/4) ... [2020-07-01 12:51:39,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11621a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (3/4) ... [2020-07-01 12:51:39,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11621a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39" (4/4) ... [2020-07-01 12:51:39,599 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:51:39,609 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:51:39,617 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-01 12:51:39,630 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-01 12:51:39,654 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:51:39,654 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:51:39,655 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:51:39,655 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:51:39,655 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:51:39,655 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:51:39,655 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:51:39,655 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:51:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-07-01 12:51:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:51:39,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:39,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:51:39,678 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 3603045, now seen corresponding path program 1 times [2020-07-01 12:51:39,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:39,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034765325] [2020-07-01 12:51:39,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:39,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034765325] [2020-07-01 12:51:39,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:39,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:39,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120014920] [2020-07-01 12:51:39,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:39,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:39,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:39,884 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2020-07-01 12:51:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:39,952 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2020-07-01 12:51:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:39,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:51:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:39,965 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:51:39,966 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:51:39,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:51:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:51:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:51:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2020-07-01 12:51:40,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 4 [2020-07-01 12:51:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,004 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-07-01 12:51:40,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. [2020-07-01 12:51:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:51:40,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:51:40,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:51:40,006 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 3603047, now seen corresponding path program 1 times [2020-07-01 12:51:40,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141470744] [2020-07-01 12:51:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141470744] [2020-07-01 12:51:40,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010851007] [2020-07-01 12:51:40,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,044 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 3 states. [2020-07-01 12:51:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,081 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-01 12:51:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:51:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,082 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:51:40,082 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:51:40,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:51:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:51:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:51:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-07-01 12:51:40,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 [2020-07-01 12:51:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,087 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-01 12:51:40,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-07-01 12:51:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:51:40,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:51:40,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:51:40,088 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 3603048, now seen corresponding path program 1 times [2020-07-01 12:51:40,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908521439] [2020-07-01 12:51:40,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908521439] [2020-07-01 12:51:40,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:51:40,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004239195] [2020-07-01 12:51:40,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:51:40,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:51:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:51:40,127 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2020-07-01 12:51:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,158 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-01 12:51:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:51:40,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 12:51:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,160 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:51:40,160 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:51:40,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:51:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:51:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:51:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:51:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 12:51:40,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-07-01 12:51:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,164 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 12:51:40,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:51:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 12:51:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:51:40,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:51:40,165 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash 111695058, now seen corresponding path program 1 times [2020-07-01 12:51:40,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163676828] [2020-07-01 12:51:40,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163676828] [2020-07-01 12:51:40,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962366658] [2020-07-01 12:51:40,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,196 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-07-01 12:51:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,231 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-01 12:51:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:51:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,232 INFO L225 Difference]: With dead ends: 11 [2020-07-01 12:51:40,232 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 12:51:40,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 12:51:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 12:51:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 12:51:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-01 12:51:40,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-07-01 12:51:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,236 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-01 12:51:40,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-01 12:51:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:51:40,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:51:40,237 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,238 INFO L82 PathProgramCache]: Analyzing trace with hash 111695060, now seen corresponding path program 1 times [2020-07-01 12:51:40,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379353538] [2020-07-01 12:51:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379353538] [2020-07-01 12:51:40,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:51:40,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778376064] [2020-07-01 12:51:40,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:51:40,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:51:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:51:40,278 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 4 states. [2020-07-01 12:51:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,325 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-01 12:51:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:51:40,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:51:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,326 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:51:40,327 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:51:40,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:51:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:51:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2020-07-01 12:51:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:51:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 12:51:40,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 [2020-07-01 12:51:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,331 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 12:51:40,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:51:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 12:51:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:51:40,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:51:40,333 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash 111695061, now seen corresponding path program 1 times [2020-07-01 12:51:40,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000335245] [2020-07-01 12:51:40,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000335245] [2020-07-01 12:51:40,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:51:40,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965165038] [2020-07-01 12:51:40,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:51:40,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:51:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:51:40,384 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. [2020-07-01 12:51:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,437 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-07-01 12:51:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:51:40,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-07-01 12:51:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,438 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:51:40,438 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 12:51:40,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:51:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 12:51:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2020-07-01 12:51:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:51:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-01 12:51:40,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 5 [2020-07-01 12:51:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,442 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-01 12:51:40,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:51:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-01 12:51:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:51:40,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:40,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:51:40,443 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash -35259792, now seen corresponding path program 1 times [2020-07-01 12:51:40,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111985419] [2020-07-01 12:51:40,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111985419] [2020-07-01 12:51:40,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421474329] [2020-07-01 12:51:40,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,476 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2020-07-01 12:51:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,501 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-01 12:51:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:51:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,503 INFO L225 Difference]: With dead ends: 11 [2020-07-01 12:51:40,503 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 12:51:40,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 12:51:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 12:51:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 12:51:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-07-01 12:51:40,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2020-07-01 12:51:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,506 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-01 12:51:40,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-01 12:51:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:51:40,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:40,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:51:40,507 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1093028459, now seen corresponding path program 1 times [2020-07-01 12:51:40,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060677732] [2020-07-01 12:51:40,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060677732] [2020-07-01 12:51:40,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650357199] [2020-07-01 12:51:40,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:51:40,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:51:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:51:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:51:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489791989] [2020-07-01 12:51:40,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:51:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:51:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:51:40,631 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2020-07-01 12:51:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,662 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 12:51:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:51:40,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:51:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,663 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:51:40,663 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:51:40,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:51:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:51:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-07-01 12:51:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 12:51:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-07-01 12:51:40,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 8 [2020-07-01 12:51:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,667 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-01 12:51:40,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:51:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-01 12:51:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:51:40,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:40,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 12:51:40,869 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1093028458, now seen corresponding path program 1 times [2020-07-01 12:51:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002422480] [2020-07-01 12:51:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:41,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002422480] [2020-07-01 12:51:41,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408261278] [2020-07-01 12:51:41,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:41,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 12:51:41,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:51:41,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:51:41,138 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:51:41,149 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:41,152 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:51:41,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 12:51:41,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:41,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:51:41,207 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:41,210 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:51:41,230 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:41,233 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:51:41,236 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:51:41,239 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:51:41,239 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 12:51:41,281 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:41,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:51:41,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-01 12:51:41,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102123249] [2020-07-01 12:51:41,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 12:51:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 12:51:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:51:41,304 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 11 states. [2020-07-01 12:51:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:42,341 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-01 12:51:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:51:42,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2020-07-01 12:51:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:42,342 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:51:42,342 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:51:42,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:51:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:51:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 12:51:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:51:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-01 12:51:42,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2020-07-01 12:51:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:42,346 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-01 12:51:42,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 12:51:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-01 12:51:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:51:42,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:42,347 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-07-01 12:51:42,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:42,548 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2030309685, now seen corresponding path program 2 times [2020-07-01 12:51:42,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:42,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205937373] [2020-07-01 12:51:42,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:42,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205937373] [2020-07-01 12:51:42,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763231740] [2020-07-01 12:51:42,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:42,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:51:42,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:51:42,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-01 12:51:42,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:51:42,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:51:42,820 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:51:42,824 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:42,824 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:51:42,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:51:42,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:51:42,843 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:51:42,852 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:42,853 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:51:42,853 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:51:42,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:42,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 12:51:42,894 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:42,895 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:51:42,906 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:42,907 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:51:42,909 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:51:42,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 12:51:42,942 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:51:42,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:51:42,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-01 12:51:42,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342786576] [2020-07-01 12:51:42,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:51:42,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:51:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:51:42,967 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-01 12:51:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:43,486 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-01 12:51:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:51:43,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-07-01 12:51:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:43,487 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:51:43,487 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:51:43,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-07-01 12:51:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:51:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-07-01 12:51:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 12:51:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-01 12:51:43,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2020-07-01 12:51:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:43,493 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-01 12:51:43,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:51:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-01 12:51:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:51:43,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:43,494 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:43,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 12:51:43,695 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:51:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1069539081, now seen corresponding path program 1 times [2020-07-01 12:51:43,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:43,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484555] [2020-07-01 12:51:43,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 12:51:43,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484555] [2020-07-01 12:51:43,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084164135] [2020-07-01 12:51:43,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:43,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 12:51:43,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:51:43,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:51:43,827 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:51:43,831 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:43,831 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:51:43,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:51:43,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:51:43,842 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:51:43,844 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:43,844 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:51:43,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:51:43,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:43,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:51:43,863 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:43,864 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:51:43,874 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:51:43,875 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:51:43,875 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 12:51:43,893 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:51:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 12:51:43,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:51:43,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-01 12:51:43,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901043602] [2020-07-01 12:51:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:51:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:51:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:51:43,908 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 9 states. [2020-07-01 12:51:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:43,996 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-01 12:51:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:51:43,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:51:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:43,997 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:51:43,997 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:51:43,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:51:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:51:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:51:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:51:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:51:43,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-01 12:51:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:43,999 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:51:43,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:51:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:51:43,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:51:44,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:51:44,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:51:44,450 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-07-01 12:51:44,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:51:44,455 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 12:51:44,455 INFO L268 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-07-01 12:51:44,455 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-07-01 12:51:44,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 16) no Hoare annotation was computed. [2020-07-01 12:51:44,456 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:51:44,456 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:51:44,456 INFO L264 CegarLoopResult]: At program point L14-4(lines 14 15) the Hoare annotation is: (let ((.cse0 (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0)) (.cse1 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse2 (= ULTIMATE.start_cstrlen_~str.base ULTIMATE.start_cstrlen_~s~0.base)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrlen_~s~0.base))) (.cse5 (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base))) (.cse6 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrlen_~s~0.base) (- 1)))))))) (or (and .cse0 .cse1 (or (< 1 ULTIMATE.start_main_~length1~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (<= 1 ULTIMATE.start_cstrlen_~s~0.offset) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~length1~0) .cse2 .cse3 (= 0 ULTIMATE.start_cstrlen_~s~0.offset) .cse4 .cse5 .cse6))) [2020-07-01 12:51:44,456 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:44,456 INFO L268 CegarLoopResult]: For program point L14-5(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:51:44,456 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:51:44,457 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:44,457 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:51:44,459 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:51:44,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:44 BasicIcfg [2020-07-01 12:51:44,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:51:44,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:51:44,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:51:44,492 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:51:44,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:44,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:51:38" (1/5) ... [2020-07-01 12:51:44,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788a83a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:51:44, skipping insertion in model container [2020-07-01 12:51:44,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:44,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:39" (2/5) ... [2020-07-01 12:51:44,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788a83a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:51:44, skipping insertion in model container [2020-07-01 12:51:44,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:44,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (3/5) ... [2020-07-01 12:51:44,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788a83a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:51:44, skipping insertion in model container [2020-07-01 12:51:44,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:44,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39" (4/5) ... [2020-07-01 12:51:44,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788a83a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:51:44, skipping insertion in model container [2020-07-01 12:51:44,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:44,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:44" (5/5) ... [2020-07-01 12:51:44,497 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:51:44,518 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:51:44,518 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:51:44,518 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:51:44,518 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:51:44,518 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:51:44,519 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:51:44,519 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:51:44,519 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:51:44,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-01 12:51:44,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:51:44,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:51:44,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:51:44,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:51:44,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:51:44,531 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:51:44,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-01 12:51:44,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:51:44,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:51:44,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:51:44,533 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:51:44,533 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:51:44,538 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue [88] ULTIMATE.startENTRY-->L21: Formula: (and (= 0 |v_#NULL.base_2|) (= |v_#valid_11| (store |v_#valid_12| 0 0)) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 11#L21true [47] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 5#L21-2true [69] L21-2-->L25: Formula: (and (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_4|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 15#L25true [89] L25-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrlen_#in~str.offset_2| v_ULTIMATE.start_cstrlen_~str.offset_4) (= v_ULTIMATE.start_cstrlen_~str.base_5 |v_ULTIMATE.start_cstrlen_#in~str.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~str.offset_2|) (= v_ULTIMATE.start_cstrlen_~str.base_5 v_ULTIMATE.start_cstrlen_~s~0.base_11) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~str.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_9 v_ULTIMATE.start_cstrlen_~str.offset_4) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_#in~str.base=|v_ULTIMATE.start_cstrlen_#in~str.base_2|, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~str.offset=|v_ULTIMATE.start_cstrlen_#in~str.offset_2|, ULTIMATE.start_cstrlen_~str.offset=v_ULTIMATE.start_cstrlen_~str.offset_4, ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_4|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_11, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_9, ULTIMATE.start_cstrlen_~str.base=v_ULTIMATE.start_cstrlen_~str.base_5, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#in~str.base, ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#res, ULTIMATE.start_cstrlen_#t~pre0.base, #memory_int, ULTIMATE.start_cstrlen_#in~str.offset, ULTIMATE.start_cstrlen_~s~0.offset, ULTIMATE.start_cstrlen_~str.base, ULTIMATE.start_cstrlen_#t~mem1, ULTIMATE.start_cstrlen_~str.offset] 10#L14-4true [2020-07-01 12:51:44,538 INFO L796 eck$LassoCheckResult]: Loop: 10#L14-4true [43] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrlen_~s~0.offset_4) (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (<= (+ v_ULTIMATE.start_cstrlen_~s~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~s~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~s~0.base_4) v_ULTIMATE.start_cstrlen_~s~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem1_2|)) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_4, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_4, ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 14#L14-1true [78] L14-1-->L14-3: Formula: (< 0 |v_ULTIMATE.start_cstrlen_#t~mem1_6|) InVars {ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_6|} OutVars{ULTIMATE.start_cstrlen_#t~mem1=|v_ULTIMATE.start_cstrlen_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem1] 13#L14-3true [50] L14-3-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrlen_~s~0.base_7 v_ULTIMATE.start_cstrlen_~s~0.base_8) (= v_ULTIMATE.start_cstrlen_~s~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~s~0.offset_7 1))) InVars {ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_8, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_7} OutVars{ULTIMATE.start_cstrlen_#t~pre0.offset=|v_ULTIMATE.start_cstrlen_#t~pre0.offset_2|, ULTIMATE.start_cstrlen_~s~0.base=v_ULTIMATE.start_cstrlen_~s~0.base_7, ULTIMATE.start_cstrlen_~s~0.offset=v_ULTIMATE.start_cstrlen_~s~0.offset_6, ULTIMATE.start_cstrlen_#t~pre0.base=|v_ULTIMATE.start_cstrlen_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~pre0.offset, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_cstrlen_#t~pre0.base, ULTIMATE.start_cstrlen_~s~0.offset] 10#L14-4true [2020-07-01 12:51:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 3592524, now seen corresponding path program 1 times [2020-07-01 12:51:44,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:44,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080110647] [2020-07-01 12:51:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:51:44,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080110647] [2020-07-01 12:51:44,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:44,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:44,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91195542] [2020-07-01 12:51:44,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:51:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:44,560 INFO L82 PathProgramCache]: Analyzing trace with hash 73582, now seen corresponding path program 1 times [2020-07-01 12:51:44,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:44,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520700462] [2020-07-01 12:51:44,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:51:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:51:44,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:51:44,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:44,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:44,611 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2020-07-01 12:51:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:44,628 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2020-07-01 12:51:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:44,631 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:51:44,635 INFO L168 Benchmark]: Toolchain (without parser) took 5825.34 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 561.2 MB in the beginning and 461.9 MB in the end (delta: 99.3 MB). Peak memory consumption was 200.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,635 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:51:44,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.58 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 561.2 MB in the beginning and 652.7 MB in the end (delta: -91.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.70 ms. Allocated memory is still 690.0 MB. Free memory was 652.7 MB in the beginning and 650.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,636 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 ms. Allocated memory is still 690.0 MB. Free memory was 650.6 MB in the beginning and 648.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,637 INFO L168 Benchmark]: RCFGBuilder took 298.26 ms. Allocated memory is still 690.0 MB. Free memory was 648.4 MB in the beginning and 629.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,637 INFO L168 Benchmark]: BlockEncodingV2 took 97.96 ms. Allocated memory is still 690.0 MB. Free memory was 629.4 MB in the beginning and 622.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,638 INFO L168 Benchmark]: TraceAbstraction took 4896.67 ms. Allocated memory was 690.0 MB in the beginning and 750.8 MB in the end (delta: 60.8 MB). Free memory was 621.8 MB in the beginning and 480.6 MB in the end (delta: 141.2 MB). Peak memory consumption was 202.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,638 INFO L168 Benchmark]: BuchiAutomizer took 144.61 ms. Allocated memory is still 750.8 MB. Free memory was 480.6 MB in the beginning and 461.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:44,641 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 21 edges - StatisticsResult: Encoded RCFG 13 locations, 21 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 316.58 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 561.2 MB in the beginning and 652.7 MB in the end (delta: -91.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.70 ms. Allocated memory is still 690.0 MB. Free memory was 652.7 MB in the beginning and 650.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.71 ms. Allocated memory is still 690.0 MB. Free memory was 650.6 MB in the beginning and 648.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 298.26 ms. Allocated memory is still 690.0 MB. Free memory was 648.4 MB in the beginning and 629.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 97.96 ms. Allocated memory is still 690.0 MB. Free memory was 629.4 MB in the beginning and 622.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4896.67 ms. Allocated memory was 690.0 MB in the beginning and 750.8 MB in the end (delta: 60.8 MB). Free memory was 621.8 MB in the beginning and 480.6 MB in the end (delta: 141.2 MB). Peak memory consumption was 202.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 144.61 ms. Allocated memory is still 750.8 MB. Free memory was 480.6 MB in the beginning and 461.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:51:44,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:51:44,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:44,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:51:44,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == nondetString1) && (1 < length1 || 1 == nondetString1 + length1)) && 1 <= s) && str == s) && 1 == \valid[nondetString1]) && 1 == \valid[s]) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s] + -1])) || ((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == nondetString1) && 1 <= length1) && str == s) && 1 == \valid[nondetString1]) && 0 == s) && 1 == \valid[s]) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s] + -1])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 179 SDslu, 80 SDs, 0 SdLazy, 288 SolverSat, 91 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 117 HoareAnnotationTreeSize, 1 FomulaSimplifications, 95 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 101 ConstructedInterpolants, 5 QuantifiedInterpolants, 7263 SizeOfPredicates, 25 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 10/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:51:35.558 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_juojoJ/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:51:44.881 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check