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/heap-data/cart_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:27,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:27,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:27,439 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:27,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:27,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:27,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:27,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:27,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:27,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:27,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:27,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:27,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:27,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:27,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:27,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:27,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:27,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:27,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:27,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:27,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:27,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:27,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:27,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:27,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:27,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:27,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:27,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:27,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:27,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:27,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:27,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:27,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:27,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:27,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:27,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:27,486 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 13:00:27,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:27,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:27,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:27,514 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:27,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:27,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:27,515 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:27,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:27,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:27,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:27,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:27,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:27,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:27,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:27,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:27,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:27,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:27,518 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:27,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:27,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:27,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:27,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:27,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:27,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:27,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:27,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:27,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:27,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:27,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:27,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:27,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:27,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:27,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:27,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:27,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:27,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:27,599 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/cart_true-unreach-call.i [2018-11-23 13:00:27,656 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76e69180/5581901edfe3421d9e2c181ec94d6ef4/FLAGee9888ed6 [2018-11-23 13:00:28,165 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:28,165 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart_true-unreach-call.i [2018-11-23 13:00:28,178 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76e69180/5581901edfe3421d9e2c181ec94d6ef4/FLAGee9888ed6 [2018-11-23 13:00:28,445 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a76e69180/5581901edfe3421d9e2c181ec94d6ef4 [2018-11-23 13:00:28,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:28,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:28,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:28,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:28,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:28,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:28" (1/1) ... [2018-11-23 13:00:28,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3460c79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:28, skipping insertion in model container [2018-11-23 13:00:28,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:28" (1/1) ... [2018-11-23 13:00:28,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:28,529 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:28,935 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:28,950 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:29,017 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:29,080 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:29,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29 WrapperNode [2018-11-23 13:00:29,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:29,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:29,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:29,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:29,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:29,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:29,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:29,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:29,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (1/1) ... [2018-11-23 13:00:29,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:29,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:29,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:29,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:29,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (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 13:00:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:29,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:29,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:29,974 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:29,974 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:00:29,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:29 BoogieIcfgContainer [2018-11-23 13:00:29,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:29,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:29,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:29,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:29,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:28" (1/3) ... [2018-11-23 13:00:29,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2bd96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:29, skipping insertion in model container [2018-11-23 13:00:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:29" (2/3) ... [2018-11-23 13:00:29,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2bd96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:29, skipping insertion in model container [2018-11-23 13:00:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:29" (3/3) ... [2018-11-23 13:00:29,983 INFO L112 eAbstractionObserver]: Analyzing ICFG cart_true-unreach-call.i [2018-11-23 13:00:29,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:30,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:30,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:30,053 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:30,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:30,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:30,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:30,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:30,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:30,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:30,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:30,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 13:00:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:00:30,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:30,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:30,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:30,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1476850041, now seen corresponding path program 1 times [2018-11-23 13:00:30,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:30,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:30,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:30,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 13:00:30,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 13:00:30,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 13:00:30,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #72#return; {28#true} is VALID [2018-11-23 13:00:30,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret13 := main(); {28#true} is VALID [2018-11-23 13:00:30,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~l~0.base, ~l~0.offset := 0, 0; {28#true} is VALID [2018-11-23 13:00:30,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 13:00:30,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {29#false} is VALID [2018-11-23 13:00:30,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 13:00:30,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {29#false} is VALID [2018-11-23 13:00:30,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem10 := read~int(~i~0.base, 8 + ~i~0.offset, 4);call #t~mem11 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {29#false} is VALID [2018-11-23 13:00:30,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume #t~mem10 > #t~mem11;havoc #t~mem11;havoc #t~mem10; {29#false} is VALID [2018-11-23 13:00:30,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 13:00:30,251 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 13:00:30,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:30,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:30,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:00:30,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:30,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:30,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:30,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:30,461 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 13:00:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:30,673 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2018-11-23 13:00:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:30,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:00:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-23 13:00:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-23 13:00:30,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 55 transitions. [2018-11-23 13:00:31,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:31,083 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:00:31,083 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:00:31,086 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 13:00:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:00:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:00:31,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:31,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:31,131 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:31,131 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:31,138 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 13:00:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 13:00:31,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:31,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:31,139 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:31,139 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:31,143 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 13:00:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 13:00:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:31,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:31,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:31,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:00:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-23 13:00:31,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2018-11-23 13:00:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:31,151 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 13:00:31,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 13:00:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:00:31,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:31,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:31,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:31,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1076950666, now seen corresponding path program 1 times [2018-11-23 13:00:31,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:31,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:31,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:31,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 13:00:31,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {156#true} is VALID [2018-11-23 13:00:31,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 13:00:31,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #72#return; {156#true} is VALID [2018-11-23 13:00:31,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret13 := main(); {156#true} is VALID [2018-11-23 13:00:31,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} ~l~0.base, ~l~0.offset := 0, 0; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} goto; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} assume !(0 != #t~nondet2);havoc #t~nondet2; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} goto; {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} assume !(~i~0.base != 0 || ~i~0.offset != 0); {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:31,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {159#(and (= 0 main_~i~0.base) (= 0 main_~i~0.offset))} is VALID [2018-11-23 13:00:31,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {159#(and (= 0 main_~i~0.base) (= 0 main_~i~0.offset))} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem10 := read~int(~i~0.base, 8 + ~i~0.offset, 4);call #t~mem11 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {157#false} is VALID [2018-11-23 13:00:31,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {157#false} assume #t~mem10 > #t~mem11;havoc #t~mem11;havoc #t~mem10; {157#false} is VALID [2018-11-23 13:00:31,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 13:00:31,403 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 13:00:31,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:31,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:31,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 13:00:31,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:31,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:31,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:31,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:31,504 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 4 states. [2018-11-23 13:00:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,081 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 13:00:32,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:00:32,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 13:00:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:00:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:00:32,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2018-11-23 13:00:32,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:32,207 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:00:32,207 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:00:32,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:00:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:00:32,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:32,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:00:32,256 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:00:32,257 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:00:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,259 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-23 13:00:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-11-23 13:00:32,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:32,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:32,261 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:00:32,261 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:00:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,264 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-23 13:00:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-11-23 13:00:32,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:32,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:32,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:32,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:00:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-23 13:00:32,268 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-11-23 13:00:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:32,268 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-23 13:00:32,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-11-23 13:00:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:00:32,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:32,269 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:32,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:32,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -121671108, now seen corresponding path program 1 times [2018-11-23 13:00:32,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:32,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:32,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2018-11-23 13:00:32,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {307#true} is VALID [2018-11-23 13:00:32,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-23 13:00:32,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #72#return; {307#true} is VALID [2018-11-23 13:00:32,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret13 := main(); {307#true} is VALID [2018-11-23 13:00:32,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {307#true} ~l~0.base, ~l~0.offset := 0, 0; {307#true} is VALID [2018-11-23 13:00:32,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#true} goto; {307#true} is VALID [2018-11-23 13:00:32,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {307#true} is VALID [2018-11-23 13:00:32,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#true} assume !!(0 != #t~nondet2);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~stock~0 := #t~nondet3;havoc #t~nondet3; {307#true} is VALID [2018-11-23 13:00:32,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#true} assume !(~stock~0 < 0);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~int(~stock~0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(0, ~p~0.base, 8 + ~p~0.offset, 4);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {309#(not (= main_~l~0.base 0))} is VALID [2018-11-23 13:00:32,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {309#(not (= main_~l~0.base 0))} goto; {309#(not (= main_~l~0.base 0))} is VALID [2018-11-23 13:00:32,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(not (= main_~l~0.base 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {309#(not (= main_~l~0.base 0))} is VALID [2018-11-23 13:00:32,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#(not (= main_~l~0.base 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {309#(not (= main_~l~0.base 0))} is VALID [2018-11-23 13:00:32,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {309#(not (= main_~l~0.base 0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {310#(not (= main_~i~0.base 0))} is VALID [2018-11-23 13:00:32,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#(not (= main_~i~0.base 0))} goto; {310#(not (= main_~i~0.base 0))} is VALID [2018-11-23 13:00:32,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {310#(not (= main_~i~0.base 0))} assume !(~i~0.base != 0 || ~i~0.offset != 0); {308#false} is VALID [2018-11-23 13:00:32,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {308#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {308#false} is VALID [2018-11-23 13:00:32,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#false} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem10 := read~int(~i~0.base, 8 + ~i~0.offset, 4);call #t~mem11 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {308#false} is VALID [2018-11-23 13:00:32,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#false} assume #t~mem10 > #t~mem11;havoc #t~mem11;havoc #t~mem10; {308#false} is VALID [2018-11-23 13:00:32,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {308#false} assume !false; {308#false} is VALID [2018-11-23 13:00:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:32,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:32,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:32,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 13:00:32,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:32,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:32,457 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 13:00:32,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:32,458 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 4 states. [2018-11-23 13:00:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,727 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 13:00:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:32,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 13:00:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 13:00:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 13:00:32,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-23 13:00:32,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:32,824 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:00:32,824 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:00:32,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:00:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-23 13:00:32,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:32,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2018-11-23 13:00:32,861 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2018-11-23 13:00:32,861 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2018-11-23 13:00:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,865 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-23 13:00:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-11-23 13:00:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:32,866 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2018-11-23 13:00:32,867 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2018-11-23 13:00:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:32,869 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-23 13:00:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-11-23 13:00:32,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:32,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:32,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:32,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:00:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 13:00:32,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 20 [2018-11-23 13:00:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 13:00:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 13:00:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:00:32,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:32,875 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:32,875 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:32,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 757239753, now seen corresponding path program 1 times [2018-11-23 13:00:32,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:32,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:32,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:00:32,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {480#true} is VALID [2018-11-23 13:00:32,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:00:32,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #72#return; {480#true} is VALID [2018-11-23 13:00:32,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret13 := main(); {480#true} is VALID [2018-11-23 13:00:32,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {480#true} ~l~0.base, ~l~0.offset := 0, 0; {480#true} is VALID [2018-11-23 13:00:32,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#true} goto; {480#true} is VALID [2018-11-23 13:00:32,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {480#true} is VALID [2018-11-23 13:00:32,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {480#true} assume !!(0 != #t~nondet2);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~stock~0 := #t~nondet3;havoc #t~nondet3; {480#true} is VALID [2018-11-23 13:00:32,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#true} assume !(~stock~0 < 0);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~int(~stock~0, ~p~0.base, 4 + ~p~0.offset, 4);call write~int(0, ~p~0.base, 8 + ~p~0.offset, 4);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {480#true} is VALID [2018-11-23 13:00:32,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {480#true} goto; {480#true} is VALID [2018-11-23 13:00:32,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {480#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {480#true} is VALID [2018-11-23 13:00:32,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {480#true} assume !(0 != #t~nondet2);havoc #t~nondet2; {480#true} is VALID [2018-11-23 13:00:32,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {480#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {480#true} is VALID [2018-11-23 13:00:32,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#true} goto; {480#true} is VALID [2018-11-23 13:00:32,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#true} assume !!(~i~0.base != 0 || ~i~0.offset != 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~order~0 < 0; {480#true} is VALID [2018-11-23 13:00:32,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {480#true} assume #t~short7; {482#|main_#t~short7|} is VALID [2018-11-23 13:00:32,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem6;call write~int(~order~0, ~i~0.base, 8 + ~i~0.offset, 4);call #t~mem8 := read~int(~i~0.base, 4 + ~i~0.offset, 4);call write~int(#t~mem8, ~i~0.base, 4 + ~i~0.offset, 4);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {481#false} is VALID [2018-11-23 13:00:32,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {481#false} goto; {481#false} is VALID [2018-11-23 13:00:32,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {481#false} assume !(~i~0.base != 0 || ~i~0.offset != 0); {481#false} is VALID [2018-11-23 13:00:32,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {481#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {481#false} is VALID [2018-11-23 13:00:32,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {481#false} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem10 := read~int(~i~0.base, 8 + ~i~0.offset, 4);call #t~mem11 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {481#false} is VALID [2018-11-23 13:00:32,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {481#false} assume #t~mem10 > #t~mem11;havoc #t~mem11;havoc #t~mem10; {481#false} is VALID [2018-11-23 13:00:32,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:00:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:00:32,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:32,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:00:32,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:00:32,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:32,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:00:33,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:33,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:00:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:00:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:33,021 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 3 states. [2018-11-23 13:00:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,115 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-23 13:00:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:00:33,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:00:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-23 13:00:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-23 13:00:33,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2018-11-23 13:00:33,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:33,258 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:00:33,259 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:00:33,259 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 13:00:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:00:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 13:00:33,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:33,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 13:00:33,293 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:00:33,293 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:00:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,296 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 13:00:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 13:00:33,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:33,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:33,297 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:00:33,297 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:00:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,299 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 13:00:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 13:00:33,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:33,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:33,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:33,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:00:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 13:00:33,302 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2018-11-23 13:00:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:33,302 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 13:00:33,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:00:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 13:00:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:00:33,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:33,303 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:33,304 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -52106873, now seen corresponding path program 1 times [2018-11-23 13:00:33,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:33,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:33,816 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 13:00:33,820 INFO L168 Benchmark]: Toolchain (without parser) took 5366.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -563.9 MB). Peak memory consumption was 178.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:33,822 INFO L168 Benchmark]: CDTParser took 0.16 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 13:00:33,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.83 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:33,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:33,824 INFO L168 Benchmark]: Boogie Preprocessor took 35.70 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 13:00:33,825 INFO L168 Benchmark]: RCFGBuilder took 742.53 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:33,826 INFO L168 Benchmark]: TraceAbstraction took 3842.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 209.3 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:33,835 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.16 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 625.83 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.70 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 742.53 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3842.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 209.3 MB). Peak memory consumption was 209.3 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...