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-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:52,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:52,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:52,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:52,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:52,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:52,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:52,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:52,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:52,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:52,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:52,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:52,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:52,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:52,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:52,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:52,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:52,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:52,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:52,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:52,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:52,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:52,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:52,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:52,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:52,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:52,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:52,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:52,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:52,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:52,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:52,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:52,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:52,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:52,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:52,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:52,444 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:55:52,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:52,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:52,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:52,473 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:52,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:52,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:52,475 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:52,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:52,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:52,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:52,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:52,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:52,477 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:52,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:52,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:52,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:52,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:52,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:52,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:52,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:52,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:52,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:52,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:52,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:52,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:52,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:52,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:52,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:52,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:52,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:52,562 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:52,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 12:55:52,624 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bddb65a/207b527585fa47829a60ba9fcda54013/FLAG80a7b985c [2018-11-23 12:55:53,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:53,171 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 12:55:53,183 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bddb65a/207b527585fa47829a60ba9fcda54013/FLAG80a7b985c [2018-11-23 12:55:53,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bddb65a/207b527585fa47829a60ba9fcda54013 [2018-11-23 12:55:53,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:53,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:53,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:53,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:53,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:53,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:53" (1/1) ... [2018-11-23 12:55:53,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc3a3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:53, skipping insertion in model container [2018-11-23 12:55:53,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:53" (1/1) ... [2018-11-23 12:55:53,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:53,553 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:54,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:54,051 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:54,129 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:54,191 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:54,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54 WrapperNode [2018-11-23 12:55:54,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:54,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:54,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:54,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:54,281 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:55:54" (1/1) ... [2018-11-23 12:55:54,305 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:55:54" (1/1) ... [2018-11-23 12:55:54,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:54,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:54,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:54,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:54,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (1/1) ... [2018-11-23 12:55:54,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:54,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:54,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:54,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:54,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (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:55:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:56,001 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:56,001 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:55:56,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:56 BoogieIcfgContainer [2018-11-23 12:55:56,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:56,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:56,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:56,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:56,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:53" (1/3) ... [2018-11-23 12:55:56,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b9ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:56, skipping insertion in model container [2018-11-23 12:55:56,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:54" (2/3) ... [2018-11-23 12:55:56,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b9ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:56, skipping insertion in model container [2018-11-23 12:55:56,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:56" (3/3) ... [2018-11-23 12:55:56,010 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 12:55:56,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:56,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:56,047 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:56,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:56,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:56,081 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:56,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:56,081 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:56,081 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:56,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:56,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:56,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 12:55:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:55:56,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:56,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:56,112 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:56,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 615932551, now seen corresponding path program 1 times [2018-11-23 12:55:56,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:56,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:56,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-23 12:55:56,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60#true} is VALID [2018-11-23 12:55:56,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 12:55:56,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #215#return; {60#true} is VALID [2018-11-23 12:55:56,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret41 := main(); {60#true} is VALID [2018-11-23 12:55:56,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {60#true} is VALID [2018-11-23 12:55:56,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-23 12:55:56,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#false} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {61#false} is VALID [2018-11-23 12:55:56,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {61#false} is VALID [2018-11-23 12:55:56,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {61#false} is VALID [2018-11-23 12:55:56,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {61#false} is VALID [2018-11-23 12:55:56,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2018-11-23 12:55:56,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:56,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:56,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2018-11-23 12:55:56,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:56,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:56,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {61#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {61#false} is VALID [2018-11-23 12:55:56,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {61#false} assume 3 != #t~mem40;havoc #t~mem40; {61#false} is VALID [2018-11-23 12:55:56,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-23 12:55:56,304 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:55:56,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:56,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:56,315 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 12:55:56,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:56,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:56,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:56,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:56,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:56,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:56,607 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-23 12:55:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,141 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-23 12:55:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:57,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 12:55:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 12:55:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 12:55:57,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-23 12:55:57,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:57,524 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:55:57,524 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:55:57,528 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:55:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:55:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:55:57,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:57,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:57,580 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:57,580 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,585 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2018-11-23 12:55:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:57,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,587 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:57,587 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,592 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2018-11-23 12:55:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:57,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:57,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:55:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2018-11-23 12:55:57,600 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2018-11-23 12:55:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:57,600 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2018-11-23 12:55:57,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:55:57,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:57,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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:55:57,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:57,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2054128225, now seen corresponding path program 1 times [2018-11-23 12:55:57,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:57,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 12:55:57,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {349#true} is VALID [2018-11-23 12:55:57,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 12:55:57,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #215#return; {349#true} is VALID [2018-11-23 12:55:57,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret41 := main(); {349#true} is VALID [2018-11-23 12:55:57,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:57,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#(not (= main_~root~0.base 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:57,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(not (= main_~root~0.base 0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:57,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(not (= main_~root~0.base 0))} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:57,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {351#(not (= main_~root~0.base 0))} assume !(~root~0.base != 0 || ~root~0.offset != 0); {350#false} is VALID [2018-11-23 12:55:57,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {350#false} is VALID [2018-11-23 12:55:57,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {350#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {350#false} is VALID [2018-11-23 12:55:57,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {350#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {350#false} is VALID [2018-11-23 12:55:57,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {350#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {350#false} is VALID [2018-11-23 12:55:57,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {350#false} is VALID [2018-11-23 12:55:57,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {350#false} is VALID [2018-11-23 12:55:57,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {350#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {350#false} is VALID [2018-11-23 12:55:57,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {350#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {350#false} is VALID [2018-11-23 12:55:57,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {350#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:57,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {350#false} assume !(1 == #t~mem36);havoc #t~mem36; {350#false} is VALID [2018-11-23 12:55:57,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {350#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:57,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {350#false} assume !(2 == #t~mem38);havoc #t~mem38; {350#false} is VALID [2018-11-23 12:55:57,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {350#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:57,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {350#false} assume 3 != #t~mem40;havoc #t~mem40; {350#false} is VALID [2018-11-23 12:55:57,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 12:55:57,904 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:55:57,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:57,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:55:57,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:55:57,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:57,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:55:57,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:57,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:55:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:55:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:55:57,976 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2018-11-23 12:55:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,296 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-11-23 12:55:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:55:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:55:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:55:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:55:58,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-23 12:55:58,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,530 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:55:58,531 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:55:58,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:55:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:55:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 12:55:58,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:58,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:58,584 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:58,585 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,589 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-23 12:55:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:58,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,591 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:58,591 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,596 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-23 12:55:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:58,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:58,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:55:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2018-11-23 12:55:58,601 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2018-11-23 12:55:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:58,602 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2018-11-23 12:55:58,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:55:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:55:58,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:58,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:58,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 623425772, now seen corresponding path program 1 times [2018-11-23 12:55:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2018-11-23 12:55:58,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {620#true} is VALID [2018-11-23 12:55:58,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2018-11-23 12:55:58,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #215#return; {620#true} is VALID [2018-11-23 12:55:58,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret41 := main(); {620#true} is VALID [2018-11-23 12:55:58,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {620#true} is VALID [2018-11-23 12:55:58,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {620#true} is VALID [2018-11-23 12:55:58,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {620#true} is VALID [2018-11-23 12:55:58,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {620#true} is VALID [2018-11-23 12:55:58,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {620#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {620#true} is VALID [2018-11-23 12:55:58,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {620#true} is VALID [2018-11-23 12:55:58,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {620#true} assume #t~short24; {622#|main_#t~short24|} is VALID [2018-11-23 12:55:58,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {622#|main_#t~short24|} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {621#false} is VALID [2018-11-23 12:55:58,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#false} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {621#false} is VALID [2018-11-23 12:55:58,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#false} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {621#false} is VALID [2018-11-23 12:55:58,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {621#false} is VALID [2018-11-23 12:55:58,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {621#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {621#false} is VALID [2018-11-23 12:55:58,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {621#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {621#false} is VALID [2018-11-23 12:55:58,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {621#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {621#false} is VALID [2018-11-23 12:55:58,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {621#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {621#false} is VALID [2018-11-23 12:55:58,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {621#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {621#false} is VALID [2018-11-23 12:55:58,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {621#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {621#false} is VALID [2018-11-23 12:55:58,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {621#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {621#false} is VALID [2018-11-23 12:55:58,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {621#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {621#false} is VALID [2018-11-23 12:55:58,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {621#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:58,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {621#false} assume !(1 == #t~mem36);havoc #t~mem36; {621#false} is VALID [2018-11-23 12:55:58,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {621#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:58,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {621#false} assume !(2 == #t~mem38);havoc #t~mem38; {621#false} is VALID [2018-11-23 12:55:58,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {621#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:58,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {621#false} assume 3 != #t~mem40;havoc #t~mem40; {621#false} is VALID [2018-11-23 12:55:58,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {621#false} assume !false; {621#false} is VALID [2018-11-23 12:55:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:58,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:58,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:55:58,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:55:58,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:58,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:55:58,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:55:58,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:55:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:55:58,783 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 3 states. [2018-11-23 12:55:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,000 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2018-11-23 12:55:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:55:59,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:55:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-23 12:55:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-23 12:55:59,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2018-11-23 12:55:59,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,161 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:55:59,162 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:55:59,162 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:55:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:55:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:55:59,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:59,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:59,195 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:59,195 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,199 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2018-11-23 12:55:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:59,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,201 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:59,201 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,205 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2018-11-23 12:55:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:59,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:59,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:55:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2018-11-23 12:55:59,210 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2018-11-23 12:55:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:59,210 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2018-11-23 12:55:59,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:55:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:55:59,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:59,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,212 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:59,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -194222678, now seen corresponding path program 1 times [2018-11-23 12:55:59,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {919#true} call ULTIMATE.init(); {919#true} is VALID [2018-11-23 12:55:59,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {919#true} is VALID [2018-11-23 12:55:59,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2018-11-23 12:55:59,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} #215#return; {919#true} is VALID [2018-11-23 12:55:59,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {919#true} call #t~ret41 := main(); {919#true} is VALID [2018-11-23 12:55:59,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {919#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {919#true} is VALID [2018-11-23 12:55:59,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {919#true} is VALID [2018-11-23 12:55:59,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {919#true} is VALID [2018-11-23 12:55:59,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {919#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {919#true} is VALID [2018-11-23 12:55:59,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {919#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {919#true} is VALID [2018-11-23 12:55:59,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {919#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {919#true} is VALID [2018-11-23 12:55:59,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {919#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {919#true} is VALID [2018-11-23 12:55:59,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {919#true} is VALID [2018-11-23 12:55:59,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {919#true} is VALID [2018-11-23 12:55:59,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {919#true} is VALID [2018-11-23 12:55:59,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {919#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {919#true} is VALID [2018-11-23 12:55:59,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {919#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {919#true} is VALID [2018-11-23 12:55:59,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {919#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {919#true} is VALID [2018-11-23 12:55:59,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {919#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {921#(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; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem36);havoc #t~mem36; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem38);havoc #t~mem38; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {923#(= 3 |main_#t~mem40|)} is VALID [2018-11-23 12:55:59,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {923#(= 3 |main_#t~mem40|)} assume 3 != #t~mem40;havoc #t~mem40; {920#false} is VALID [2018-11-23 12:55:59,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {920#false} assume !false; {920#false} is VALID [2018-11-23 12:55:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:59,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:59,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:59,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:55:59,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:59,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:59,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:59,456 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 5 states. [2018-11-23 12:56:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,032 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-23 12:56:00,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:00,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:56:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-23 12:56:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-23 12:56:00,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2018-11-23 12:56:00,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:00,197 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:56:00,197 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:56:00,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:56:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:56:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-11-23 12:56:00,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:00,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 66 states. [2018-11-23 12:56:00,223 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 66 states. [2018-11-23 12:56:00,224 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 66 states. [2018-11-23 12:56:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,228 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-23 12:56:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-23 12:56:00,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,229 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 78 states. [2018-11-23 12:56:00,229 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 78 states. [2018-11-23 12:56:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,234 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-23 12:56:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-23 12:56:00,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:00,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:56:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 12:56:00,238 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2018-11-23 12:56:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:00,239 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 12:56:00,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 12:56:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:56:00,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:00,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:00,241 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:00,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:00,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1915719579, now seen corresponding path program 1 times [2018-11-23 12:56:00,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:00,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-23 12:56:00,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-23 12:56:00,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-23 12:56:00,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #215#return; {1263#true} is VALID [2018-11-23 12:56:00,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret41 := main(); {1263#true} is VALID [2018-11-23 12:56:00,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1263#true} is VALID [2018-11-23 12:56:00,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1263#true} is VALID [2018-11-23 12:56:00,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1263#true} is VALID [2018-11-23 12:56:00,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1263#true} is VALID [2018-11-23 12:56:00,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1263#true} is VALID [2018-11-23 12:56:00,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1263#true} is VALID [2018-11-23 12:56:00,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1263#true} is VALID [2018-11-23 12:56:00,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1263#true} is VALID [2018-11-23 12:56:00,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1263#true} is VALID [2018-11-23 12:56:00,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1263#true} is VALID [2018-11-23 12:56:00,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1263#true} is VALID [2018-11-23 12:56:00,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1263#true} is VALID [2018-11-23 12:56:00,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1263#true} is VALID [2018-11-23 12:56:00,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {1263#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {1265#(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; {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:00,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:00,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem36);havoc #t~mem36; {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:00,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1267#(= 3 |main_#t~mem38|)} is VALID [2018-11-23 12:56:00,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {1267#(= 3 |main_#t~mem38|)} assume !!(2 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {1264#false} is VALID [2018-11-23 12:56:00,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1264#false} is VALID [2018-11-23 12:56:00,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} assume !(2 == #t~mem38);havoc #t~mem38; {1264#false} is VALID [2018-11-23 12:56:00,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1264#false} is VALID [2018-11-23 12:56:00,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume 3 != #t~mem40;havoc #t~mem40; {1264#false} is VALID [2018-11-23 12:56:00,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-23 12:56:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:00,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:00,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:56:00,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:00,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:00,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:00,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:00,472 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 5 states. [2018-11-23 12:56:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,026 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:56:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:01,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:56:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:56:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:56:01,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:56:01,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,147 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:56:01,148 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:56:01,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:56:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:56:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2018-11-23 12:56:01,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:01,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 64 states. [2018-11-23 12:56:01,181 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 64 states. [2018-11-23 12:56:01,181 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 64 states. [2018-11-23 12:56:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,186 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-23 12:56:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-23 12:56:01,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,187 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 76 states. [2018-11-23 12:56:01,187 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 76 states. [2018-11-23 12:56:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,191 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-23 12:56:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-23 12:56:01,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:01,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:56:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-11-23 12:56:01,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2018-11-23 12:56:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:01,195 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-11-23 12:56:01,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-11-23 12:56:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:56:01,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:01,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:01,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:01,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -891016603, now seen corresponding path program 1 times [2018-11-23 12:56:01,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:01,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:01,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {1603#true} call ULTIMATE.init(); {1603#true} is VALID [2018-11-23 12:56:01,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {1603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1603#true} is VALID [2018-11-23 12:56:01,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {1603#true} assume true; {1603#true} is VALID [2018-11-23 12:56:01,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1603#true} {1603#true} #215#return; {1603#true} is VALID [2018-11-23 12:56:01,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {1603#true} call #t~ret41 := main(); {1603#true} is VALID [2018-11-23 12:56:01,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {1603#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1603#true} is VALID [2018-11-23 12:56:01,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {1603#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1603#true} is VALID [2018-11-23 12:56:01,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {1603#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1603#true} is VALID [2018-11-23 12:56:01,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {1603#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1603#true} is VALID [2018-11-23 12:56:01,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {1603#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1603#true} is VALID [2018-11-23 12:56:01,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {1603#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1603#true} is VALID [2018-11-23 12:56:01,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {1603#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1603#true} is VALID [2018-11-23 12:56:01,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {1603#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1603#true} is VALID [2018-11-23 12:56:01,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {1603#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1603#true} is VALID [2018-11-23 12:56:01,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {1603#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1603#true} is VALID [2018-11-23 12:56:01,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {1603#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1603#true} is VALID [2018-11-23 12:56:01,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1603#true} is VALID [2018-11-23 12:56:01,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {1603#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1603#true} is VALID [2018-11-23 12:56:01,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {1603#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(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; {1606#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:56:01,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {1606#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1607#(= |main_#t~mem36| 3)} is VALID [2018-11-23 12:56:01,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {1607#(= |main_#t~mem36| 3)} assume !!(1 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {1604#false} is VALID [2018-11-23 12:56:01,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {1604#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:56:01,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {1604#false} assume !(1 == #t~mem36);havoc #t~mem36; {1604#false} is VALID [2018-11-23 12:56:01,373 INFO L273 TraceCheckUtils]: 28: Hoare triple {1604#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:56:01,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {1604#false} assume !(2 == #t~mem38);havoc #t~mem38; {1604#false} is VALID [2018-11-23 12:56:01,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {1604#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:56:01,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {1604#false} assume 3 != #t~mem40;havoc #t~mem40; {1604#false} is VALID [2018-11-23 12:56:01,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {1604#false} assume !false; {1604#false} is VALID [2018-11-23 12:56:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:01,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:01,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:01,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:56:01,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:01,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:01,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:01,441 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 5 states. [2018-11-23 12:56:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,173 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:56:02,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:02,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:56:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:56:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:56:02,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:56:02,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:02,326 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:56:02,326 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:56:02,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:56:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:56:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-11-23 12:56:02,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:02,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 61 states. [2018-11-23 12:56:02,345 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 61 states. [2018-11-23 12:56:02,345 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 61 states. [2018-11-23 12:56:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,348 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-23 12:56:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2018-11-23 12:56:02,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,349 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 73 states. [2018-11-23 12:56:02,350 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 73 states. [2018-11-23 12:56:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,353 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-23 12:56:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2018-11-23 12:56:02,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:02,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:56:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2018-11-23 12:56:02,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2018-11-23 12:56:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:02,357 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2018-11-23 12:56:02,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-23 12:56:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:56:02,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:02,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:02,358 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:02,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1255728367, now seen corresponding path program 1 times [2018-11-23 12:56:02,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:02,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:02,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:02,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1934#true} call ULTIMATE.init(); {1934#true} is VALID [2018-11-23 12:56:02,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1934#true} is VALID [2018-11-23 12:56:02,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {1934#true} assume true; {1934#true} is VALID [2018-11-23 12:56:02,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1934#true} {1934#true} #215#return; {1934#true} is VALID [2018-11-23 12:56:02,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {1934#true} call #t~ret41 := main(); {1934#true} is VALID [2018-11-23 12:56:02,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {1934#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1934#true} is VALID [2018-11-23 12:56:02,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {1934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1934#true} is VALID [2018-11-23 12:56:02,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {1934#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1934#true} is VALID [2018-11-23 12:56:02,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {1934#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1934#true} is VALID [2018-11-23 12:56:02,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {1934#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1934#true} is VALID [2018-11-23 12:56:02,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {1934#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1934#true} is VALID [2018-11-23 12:56:02,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {1934#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1934#true} is VALID [2018-11-23 12:56:02,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {1934#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1934#true} is VALID [2018-11-23 12:56:02,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {1934#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1934#true} is VALID [2018-11-23 12:56:02,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {1934#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1934#true} is VALID [2018-11-23 12:56:02,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {1934#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1934#true} is VALID [2018-11-23 12:56:02,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {1934#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:02,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:02,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:02,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:02,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {1938#(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:56:02,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {1938#(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); {1938#(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:56:02,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {1938#(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~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {1939#(= 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:56:02,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {1939#(= 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~nondet30 && #t~nondet30 <= 2147483647; {1939#(= 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:56:02,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#(= 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~nondet30);havoc #t~nondet30; {1939#(= 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:56:02,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#(= 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~nondet33 && #t~nondet33 <= 2147483647; {1939#(= 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:56:02,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#(= 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~nondet33);havoc #t~nondet33; {1939#(= 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:56:02,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {1939#(= 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; {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:02,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1941#(= 1 |main_#t~mem36|)} is VALID [2018-11-23 12:56:02,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {1941#(= 1 |main_#t~mem36|)} assume !(1 == #t~mem36);havoc #t~mem36; {1935#false} is VALID [2018-11-23 12:56:02,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {1935#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:56:02,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {1935#false} assume !(2 == #t~mem38);havoc #t~mem38; {1935#false} is VALID [2018-11-23 12:56:02,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {1935#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:56:02,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {1935#false} assume 3 != #t~mem40;havoc #t~mem40; {1935#false} is VALID [2018-11-23 12:56:02,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2018-11-23 12:56:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:02,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:02,685 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:56:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:02,906 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:56:02,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:56:02,923 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:02,924 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (= |#valid| (store |v_#valid_21| main_~a~0.base 1)) [2018-11-23 12:56:02,924 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:56:03,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,288 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:56:03,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,355 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 11 treesize of output 8 [2018-11-23 12:56:03,377 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:56:03,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:56:03,498 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,498 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, |v_#valid_22|]. (and (= (store |v_#memory_int_36| main_~p~0.base (store (select |v_#memory_int_36| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= 1 (select |v_#valid_22| main_~p~0.base)) (= 0 (select |v_#valid_22| main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:03,499 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:03,559 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:56:03,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,570 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:56:03,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:56:03,891 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:56:03,896 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:56:03,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,916 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:56:03,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:56:03,923 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,923 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= (store |v_#memory_int_38| v_main_~p~0.base_18 (store (select |v_#memory_int_38| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|) (= 1 (select (select |v_#memory_int_38| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_18 main_~p~0.base))) [2018-11-23 12:56:03,923 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:56:03,973 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:56:04,009 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:56:04,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:04,053 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:56:04,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:04,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:04,063 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:56:04,064 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:56:04,066 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:04,067 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= |main_#t~mem36| .cse0) (= 1 .cse0))) [2018-11-23 12:56:04,067 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| 1) [2018-11-23 12:56:04,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {1934#true} call ULTIMATE.init(); {1934#true} is VALID [2018-11-23 12:56:04,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {1934#true} assume true; {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1934#true} {1934#true} #215#return; {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {1934#true} call #t~ret41 := main(); {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {1934#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1934#true} is VALID [2018-11-23 12:56:04,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1934#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1934#true} is VALID [2018-11-23 12:56:04,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {1934#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1934#true} is VALID [2018-11-23 12:56:04,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {1934#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1934#true} is VALID [2018-11-23 12:56:04,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {1934#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1934#true} is VALID [2018-11-23 12:56:04,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {1934#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1934#true} is VALID [2018-11-23 12:56:04,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {1934#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1934#true} is VALID [2018-11-23 12:56:04,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {1934#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1934#true} is VALID [2018-11-23 12:56:04,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {1934#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1934#true} is VALID [2018-11-23 12:56:04,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1934#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1934#true} is VALID [2018-11-23 12:56:04,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {1934#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:04,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:04,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:04,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:04,081 INFO L273 TraceCheckUtils]: 20: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {1938#(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:56:04,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {1938#(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); {1938#(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:56:04,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {1938#(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~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2011#(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:56:04,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {2011#(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~nondet30 && #t~nondet30 <= 2147483647; {2011#(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:56:04,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {2011#(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~nondet30);havoc #t~nondet30; {2011#(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:56:04,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {2011#(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~nondet33 && #t~nondet33 <= 2147483647; {2011#(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:56:04,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {2011#(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~nondet33);havoc #t~nondet33; {2011#(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:56:04,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {2011#(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; {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-23 12:56:04,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1941#(= 1 |main_#t~mem36|)} is VALID [2018-11-23 12:56:04,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {1941#(= 1 |main_#t~mem36|)} assume !(1 == #t~mem36);havoc #t~mem36; {1935#false} is VALID [2018-11-23 12:56:04,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {1935#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:56:04,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {1935#false} assume !(2 == #t~mem38);havoc #t~mem38; {1935#false} is VALID [2018-11-23 12:56:04,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {1935#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:56:04,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {1935#false} assume 3 != #t~mem40;havoc #t~mem40; {1935#false} is VALID [2018-11-23 12:56:04,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2018-11-23 12:56:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:56:04,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:04,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:04,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:56:04,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:04,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:04,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:04,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:04,163 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2018-11-23 12:56:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,310 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 12:56:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:56:05,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2018-11-23 12:56:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2018-11-23 12:56:05,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 102 transitions. [2018-11-23 12:56:05,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:05,476 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:56:05,476 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:56:05,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:56:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:56:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-11-23 12:56:05,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:05,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 70 states. [2018-11-23 12:56:05,509 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 70 states. [2018-11-23 12:56:05,509 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 70 states. [2018-11-23 12:56:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,512 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:56:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2018-11-23 12:56:05,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:05,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:05,513 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 84 states. [2018-11-23 12:56:05,513 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 84 states. [2018-11-23 12:56:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,516 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:56:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2018-11-23 12:56:05,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:05,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:05,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:05,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:56:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2018-11-23 12:56:05,519 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2018-11-23 12:56:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:05,520 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-23 12:56:05,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2018-11-23 12:56:05,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:56:05,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:05,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:05,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:05,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:05,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2119130031, now seen corresponding path program 1 times [2018-11-23 12:56:05,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:05,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:05,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 12:56:05,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 12:56:05,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 12:56:05,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #215#return; {2419#true} is VALID [2018-11-23 12:56:05,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret41 := main(); {2419#true} is VALID [2018-11-23 12:56:05,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2419#true} is VALID [2018-11-23 12:56:05,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2419#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2419#true} is VALID [2018-11-23 12:56:05,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {2419#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2419#true} is VALID [2018-11-23 12:56:05,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {2419#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2419#true} is VALID [2018-11-23 12:56:05,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {2419#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2419#true} is VALID [2018-11-23 12:56:05,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2419#true} is VALID [2018-11-23 12:56:05,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {2419#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2419#true} is VALID [2018-11-23 12:56:05,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {2419#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {2419#true} is VALID [2018-11-23 12:56:05,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {2419#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2419#true} is VALID [2018-11-23 12:56:05,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2419#true} is VALID [2018-11-23 12:56:05,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2419#true} is VALID [2018-11-23 12:56:05,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {2419#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2421#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:05,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2421#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:05,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:05,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:05,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:05,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:05,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {2423#(and (= 2 (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:56:05,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {2423#(and (= 2 (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); {2423#(and (= 2 (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:56:05,814 INFO L273 TraceCheckUtils]: 24: Hoare triple {2423#(and (= 2 (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~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2424#(= 2 (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:56:05,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {2424#(= 2 (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~nondet33 && #t~nondet33 <= 2147483647; {2424#(= 2 (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:56:05,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {2424#(= 2 (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~nondet33);havoc #t~nondet33; {2424#(= 2 (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:56:05,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {2424#(= 2 (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; {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:05,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:05,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem36);havoc #t~mem36; {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:05,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {2425#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2426#(= 2 |main_#t~mem38|)} is VALID [2018-11-23 12:56:05,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {2426#(= 2 |main_#t~mem38|)} assume !(2 == #t~mem38);havoc #t~mem38; {2420#false} is VALID [2018-11-23 12:56:05,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {2420#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2420#false} is VALID [2018-11-23 12:56:05,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {2420#false} assume 3 != #t~mem40;havoc #t~mem40; {2420#false} is VALID [2018-11-23 12:56:05,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 12:56:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:05,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:56:05,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:05,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:05,914 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:56:05,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:56:05,920 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:05,921 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (= (store |v_#valid_23| main_~a~0.base 1) |#valid|) [2018-11-23 12:56:05,921 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:56:05,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:05,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:05,959 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:56:05,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,976 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 11 treesize of output 8 [2018-11-23 12:56:05,980 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:56:05,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:05,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:56:05,999 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:05,999 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_#valid_24|]. (and (= 1 (select |v_#valid_24| main_~p~0.base)) (= (select |v_#valid_24| main_~t~0.base) 0) (= |#memory_int| (store |v_#memory_int_39| main_~p~0.base (store (select |v_#memory_int_39| main_~p~0.base) main_~p~0.offset 2))) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:05,999 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:06,059 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:56:06,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:06,065 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:56:06,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:56:06,120 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:56:06,131 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:56:06,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,148 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:56:06,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:56:06,151 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:06,152 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |v_#memory_int_41| main_~p~0.base) main_~p~0.offset) 2) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_41| v_main_~p~0.base_20 (store (select |v_#memory_int_41| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)))) [2018-11-23 12:56:06,152 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:56:06,217 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:56:06,223 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:56:06,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,235 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:56:06,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:06,249 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:56:06,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:56:06,252 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:06,252 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= |main_#t~mem38| .cse0) (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 2 .cse0))) [2018-11-23 12:56:06,252 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem38| 2) [2018-11-23 12:56:06,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 12:56:06,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 12:56:06,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 12:56:06,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #215#return; {2419#true} is VALID [2018-11-23 12:56:06,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret41 := main(); {2419#true} is VALID [2018-11-23 12:56:06,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {2419#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {2419#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {2419#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {2419#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2419#true} is VALID [2018-11-23 12:56:06,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {2419#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2419#true} is VALID [2018-11-23 12:56:06,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {2419#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {2419#true} is VALID [2018-11-23 12:56:06,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {2419#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2419#true} is VALID [2018-11-23 12:56:06,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2419#true} is VALID [2018-11-23 12:56:06,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2419#true} is VALID [2018-11-23 12:56:06,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {2419#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2421#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:06,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2421#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:06,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:06,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:06,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:06,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:06,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {2422#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {2423#(and (= 2 (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:56:06,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {2423#(and (= 2 (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); {2423#(and (= 2 (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:56:06,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {2423#(and (= 2 (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~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:06,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:06,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:06,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {2502#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (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; {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:56:06,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:56:06,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume !(1 == #t~mem36);havoc #t~mem36; {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:56:06,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {2512#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2426#(= 2 |main_#t~mem38|)} is VALID [2018-11-23 12:56:06,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {2426#(= 2 |main_#t~mem38|)} assume !(2 == #t~mem38);havoc #t~mem38; {2420#false} is VALID [2018-11-23 12:56:06,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {2420#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2420#false} is VALID [2018-11-23 12:56:06,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {2420#false} assume 3 != #t~mem40;havoc #t~mem40; {2420#false} is VALID [2018-11-23 12:56:06,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 12:56:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:06,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:56:06,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:06,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:06,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:56:06,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:06,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:06,348 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 10 states. [2018-11-23 12:56:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:07,729 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2018-11-23 12:56:07,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:56:07,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-23 12:56:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-23 12:56:07,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2018-11-23 12:56:07,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:07,906 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:56:07,906 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:56:07,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:56:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:56:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-23 12:56:07,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:07,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:07,939 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:07,939 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:07,943 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 12:56:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 12:56:07,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:07,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:07,944 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 89 states. [2018-11-23 12:56:07,944 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 89 states. [2018-11-23 12:56:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:07,948 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 12:56:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 12:56:07,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:07,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:07,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:07,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:56:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-11-23 12:56:07,952 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2018-11-23 12:56:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:07,952 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-11-23 12:56:07,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-11-23 12:56:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:56:07,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:07,953 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,953 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:07,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1204232716, now seen corresponding path program 1 times [2018-11-23 12:56:07,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:07,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:07,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:08,483 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:56:08,488 INFO L168 Benchmark]: Toolchain (without parser) took 15023.57 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 862.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -401.4 MB). Peak memory consumption was 461.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:08,490 INFO L168 Benchmark]: CDTParser took 0.28 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:56:08,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:08,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.84 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.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:08,491 INFO L168 Benchmark]: Boogie Preprocessor took 77.65 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:56:08,492 INFO L168 Benchmark]: RCFGBuilder took 1609.69 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:08,493 INFO L168 Benchmark]: TraceAbstraction took 12484.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 319.7 MB). Peak memory consumption was 448.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:08,498 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.28 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 726.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 120.84 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.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.65 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 1609.69 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12484.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 319.7 MB). Peak memory consumption was 448.2 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...