java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:59,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:59,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:59,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:59,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:59,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:59,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:59,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:59,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:59,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:59,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:59,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:59,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:59,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:59,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:59,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:59,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:59,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:59,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:59,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:59,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:59,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:59,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:59,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:59,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:59,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:59,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:59,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:59,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:59,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:59,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:59,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:59,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:59,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:59,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:59,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:59,387 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:52:59,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:59,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:59,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:59,411 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:59,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:59,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:59,412 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:59,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:59,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:59,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:59,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:59,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:59,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:59,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:59,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:59,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:59,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:59,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:59,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:59,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:59,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:59,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:59,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:59,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:59,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:59,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:59,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:59,416 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:59,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:59,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:59,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:59,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:59,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:59,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:59,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:59,493 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:59,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:52:59,561 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051be09e/f818e2d6681d4ff2833d766682b1e973/FLAG5b28777c3 [2018-11-23 12:53:00,122 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:00,123 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:53:00,146 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051be09e/f818e2d6681d4ff2833d766682b1e973/FLAG5b28777c3 [2018-11-23 12:53:00,408 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051be09e/f818e2d6681d4ff2833d766682b1e973 [2018-11-23 12:53:00,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:00,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:00,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:00,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:00,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:00,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:00" (1/1) ... [2018-11-23 12:53:00,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f55dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:00, skipping insertion in model container [2018-11-23 12:53:00,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:00" (1/1) ... [2018-11-23 12:53:00,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:00,507 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:00,869 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:00,884 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:00,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:01,036 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:01,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01 WrapperNode [2018-11-23 12:53:01,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:01,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:01,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:01,038 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:01,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:01,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:01,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:01,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:01,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... [2018-11-23 12:53:01,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:01,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:01,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:01,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:01,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:53:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:02,095 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:02,096 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:53:02,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:02 BoogieIcfgContainer [2018-11-23 12:53:02,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:02,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:02,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:02,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:02,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:00" (1/3) ... [2018-11-23 12:53:02,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29917af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:02, skipping insertion in model container [2018-11-23 12:53:02,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:01" (2/3) ... [2018-11-23 12:53:02,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29917af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:02, skipping insertion in model container [2018-11-23 12:53:02,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:02" (3/3) ... [2018-11-23 12:53:02,105 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:53:02,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:02,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:02,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:02,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:02,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:02,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:02,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:02,182 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:02,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:02,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:02,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:02,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 12:53:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:53:02,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:02,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:02,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:02,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash 985352840, now seen corresponding path program 1 times [2018-11-23 12:53:02,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:02,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:02,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:02,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 12:53:02,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 12:53:02,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 12:53:02,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #97#return; {38#true} is VALID [2018-11-23 12:53:02,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret10 := main(); {38#true} is VALID [2018-11-23 12:53:02,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {38#true} is VALID [2018-11-23 12:53:02,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {38#true} is VALID [2018-11-23 12:53:02,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {38#true} is VALID [2018-11-23 12:53:02,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 12:53:02,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {39#false} is VALID [2018-11-23 12:53:02,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {39#false} is VALID [2018-11-23 12:53:02,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(3 != #t~mem4);havoc #t~mem4; {39#false} is VALID [2018-11-23 12:53:02,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !(0 != ~flag~0);~flag~0 := 1;call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {39#false} is VALID [2018-11-23 12:53:02,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} assume 2 != #t~mem6;havoc #t~mem6; {39#false} is VALID [2018-11-23 12:53:02,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 12:53:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:02,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:02,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:02,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:53:02,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:02,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:02,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:02,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:02,639 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 12:53:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:02,787 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-11-23 12:53:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:02,787 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:53:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:53:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 12:53:02,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 12:53:03,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:03,064 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:53:03,064 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:53:03,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:53:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 12:53:03,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:03,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 12:53:03,106 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:53:03,106 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:53:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,111 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 12:53:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 12:53:03,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:03,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:03,112 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:53:03,112 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:53:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,117 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 12:53:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 12:53:03,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:03,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:03,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:03,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:53:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 12:53:03,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2018-11-23 12:53:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:03,124 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 12:53:03,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 12:53:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:53:03,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:03,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:03,125 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:03,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash -811727628, now seen corresponding path program 1 times [2018-11-23 12:53:03,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:03,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2018-11-23 12:53:03,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {185#true} is VALID [2018-11-23 12:53:03,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2018-11-23 12:53:03,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #97#return; {185#true} is VALID [2018-11-23 12:53:03,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret10 := main(); {185#true} is VALID [2018-11-23 12:53:03,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {185#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {185#true} is VALID [2018-11-23 12:53:03,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {185#true} is VALID [2018-11-23 12:53:03,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {185#true} is VALID [2018-11-23 12:53:03,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {185#true} is VALID [2018-11-23 12:53:03,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {185#true} is VALID [2018-11-23 12:53:03,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {185#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {187#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:03,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {187#(= main_~flag~0 1)} call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {187#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:03,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {187#(= main_~flag~0 1)} assume !!(3 != #t~mem4);havoc #t~mem4; {187#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:03,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {187#(= main_~flag~0 1)} assume !(0 != ~flag~0);~flag~0 := 1;call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {186#false} is VALID [2018-11-23 12:53:03,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {186#false} assume 2 != #t~mem6;havoc #t~mem6; {186#false} is VALID [2018-11-23 12:53:03,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2018-11-23 12:53:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:03,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:53:03,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:03,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:03,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:03,385 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 12:53:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,892 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 12:53:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:03,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:53:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:53:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:53:03,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:53:04,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:04,086 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:53:04,086 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:53:04,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:53:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 12:53:04,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:04,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2018-11-23 12:53:04,119 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2018-11-23 12:53:04,120 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2018-11-23 12:53:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,123 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:53:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:53:04,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,125 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2018-11-23 12:53:04,125 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2018-11-23 12:53:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,128 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:53:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:53:04,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:04,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:53:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 12:53:04,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2018-11-23 12:53:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:04,133 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 12:53:04,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:53:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:53:04,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:04,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:04,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:04,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -811734572, now seen corresponding path program 1 times [2018-11-23 12:53:04,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:04,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2018-11-23 12:53:04,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {368#true} is VALID [2018-11-23 12:53:04,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2018-11-23 12:53:04,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #97#return; {368#true} is VALID [2018-11-23 12:53:04,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret10 := main(); {368#true} is VALID [2018-11-23 12:53:04,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {368#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {368#true} is VALID [2018-11-23 12:53:04,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {368#true} is VALID [2018-11-23 12:53:04,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {368#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {370#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {371#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:04,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {371#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {372#(= |main_#t~mem4| 3)} is VALID [2018-11-23 12:53:04,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {372#(= |main_#t~mem4| 3)} assume !!(3 != #t~mem4);havoc #t~mem4; {369#false} is VALID [2018-11-23 12:53:04,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {369#false} assume 0 != ~flag~0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {369#false} is VALID [2018-11-23 12:53:04,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {369#false} assume 1 != #t~mem5;havoc #t~mem5; {369#false} is VALID [2018-11-23 12:53:04,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {369#false} assume !false; {369#false} is VALID [2018-11-23 12:53:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:04,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:04,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:04,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:53:04,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:04,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:04,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:04,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:04,402 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2018-11-23 12:53:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,753 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:53:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:04,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:53:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:53:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:53:04,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 12:53:04,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:04,923 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:53:04,923 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:53:04,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:53:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:53:04,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:04,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:53:04,951 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:53:04,951 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:53:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,954 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:53:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:53:04,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,956 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:53:04,956 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:53:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,959 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:53:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:53:04,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:04,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:53:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 12:53:04,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2018-11-23 12:53:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:04,963 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 12:53:04,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:53:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:53:04,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:04,965 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:04,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:04,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -506955009, now seen corresponding path program 1 times [2018-11-23 12:53:04,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:04,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:05,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2018-11-23 12:53:05,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {593#true} is VALID [2018-11-23 12:53:05,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2018-11-23 12:53:05,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #97#return; {593#true} is VALID [2018-11-23 12:53:05,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret10 := main(); {593#true} is VALID [2018-11-23 12:53:05,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {593#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {595#(= main_~flag~0 (select |#valid| main_~a~0.base))} is VALID [2018-11-23 12:53:05,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#(= main_~flag~0 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {595#(= main_~flag~0 (select |#valid| main_~a~0.base))} is VALID [2018-11-23 12:53:05,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {595#(= main_~flag~0 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1; {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {596#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; {597#(and (not (= 0 (select |#valid| main_~p~0.base))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {597#(and (not (= 0 (select |#valid| main_~p~0.base))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:05,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:53:05,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:53:05,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:53:05,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:05,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:05,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(3 != #t~mem4);havoc #t~mem4; {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:05,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {600#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {601#(= |main_#t~mem5| 1)} is VALID [2018-11-23 12:53:05,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {601#(= |main_#t~mem5| 1)} assume 1 != #t~mem5;havoc #t~mem5; {594#false} is VALID [2018-11-23 12:53:05,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {594#false} assume !false; {594#false} is VALID [2018-11-23 12:53:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:05,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:05,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:53:05,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:05,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:05,494 INFO L478 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 [2018-11-23 12:53:05,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:53:05,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:05,512 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= |#valid| (store |v_#valid_15| main_~a~0.base 1)) [2018-11-23 12:53:05,512 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:53:05,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:05,774 INFO L478 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 8 treesize of output 7 [2018-11-23 12:53:05,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:05,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:05,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:05,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:53:05,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:05,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 12:53:06,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:53:06,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:06,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:53:06,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:53:06,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:53:06,270 INFO L478 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 8 treesize of output 7 [2018-11-23 12:53:06,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,291 INFO L267 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. [2018-11-23 12:53:06,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:06,298 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:06,299 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, v_main_~p~0.base_19, v_main_~p~0.offset_19]. (and (= (select (select |v_#memory_int_17| main_~p~0.base) main_~p~0.offset) 1) (= |#memory_int| (store |v_#memory_int_17| v_main_~p~0.base_19 (store (select |v_#memory_int_17| v_main_~p~0.base_19) v_main_~p~0.offset_19 3))) (not (= v_main_~p~0.base_19 main_~p~0.base))) [2018-11-23 12:53:06,299 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_19, v_main_~p~0.offset_19]. (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_19 main_~p~0.base))) [2018-11-23 12:53:06,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:53:06,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 12:53:06,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 12:53:06,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:06,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:06,470 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:06,470 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_19, v_main_~p~0.offset_19]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= |main_#t~mem5| .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (= 1 .cse0) (not (= v_main_~p~0.base_19 main_~p~0.base)))) [2018-11-23 12:53:06,471 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem5|) [2018-11-23 12:53:06,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2018-11-23 12:53:06,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {593#true} is VALID [2018-11-23 12:53:06,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2018-11-23 12:53:06,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #97#return; {593#true} is VALID [2018-11-23 12:53:06,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret10 := main(); {593#true} is VALID [2018-11-23 12:53:06,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {593#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {620#(= 1 (select |#valid| main_~a~0.base))} is VALID [2018-11-23 12:53:06,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {620#(= 1 (select |#valid| main_~a~0.base))} is VALID [2018-11-23 12:53:06,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:06,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:06,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet1);havoc #t~nondet1; {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:06,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; {637#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:06,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {637#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:06,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:06,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:06,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:06,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:06,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {647#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:06,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:06,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(3 != #t~mem4);havoc #t~mem4; {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:06,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {657#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume 0 != ~flag~0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {601#(= |main_#t~mem5| 1)} is VALID [2018-11-23 12:53:06,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {601#(= |main_#t~mem5| 1)} assume 1 != #t~mem5;havoc #t~mem5; {594#false} is VALID [2018-11-23 12:53:06,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {594#false} assume !false; {594#false} is VALID [2018-11-23 12:53:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:06,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:06,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 12:53:06,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-11-23 12:53:06,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:06,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:53:06,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:53:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:53:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:53:06,626 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 14 states. [2018-11-23 12:53:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:08,539 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-23 12:53:08,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:53:08,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-11-23 12:53:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:53:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2018-11-23 12:53:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:53:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2018-11-23 12:53:08,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2018-11-23 12:53:08,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:08,688 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:53:08,688 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:53:08,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:53:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:53:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2018-11-23 12:53:08,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:08,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 46 states. [2018-11-23 12:53:08,774 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 46 states. [2018-11-23 12:53:08,775 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 46 states. [2018-11-23 12:53:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:08,778 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:53:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:53:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:08,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 64 states. [2018-11-23 12:53:08,780 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 64 states. [2018-11-23 12:53:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:08,785 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:53:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:53:08,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:08,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:08,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:08,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:53:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 12:53:08,794 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-11-23 12:53:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:08,794 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 12:53:08,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:53:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:53:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:53:08,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:08,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:08,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 703570635, now seen corresponding path program 1 times [2018-11-23 12:53:08,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:09,292 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-23 12:53:09,298 INFO L168 Benchmark]: Toolchain (without parser) took 8877.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -259.2 MB). Peak memory consumption was 474.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:09,300 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:09,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:09,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:09,302 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:09,302 INFO L168 Benchmark]: RCFGBuilder took 907.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:09,303 INFO L168 Benchmark]: TraceAbstraction took 7198.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 486.7 MB). Peak memory consumption was 486.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:09,308 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 616.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 907.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7198.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 486.7 MB). Peak memory consumption was 486.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...