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/min_max_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:32,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:32,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:32,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:32,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:32,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:32,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:32,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:32,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:32,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:32,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:32,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:32,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:32,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:32,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:32,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:32,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:32,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:32,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:32,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:32,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:32,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:32,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:32,452 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:32,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:32,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:32,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:32,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:32,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:32,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:32,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:32,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:32,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:32,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:32,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:32,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:32,464 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:32,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:32,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:32,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:32,480 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:32,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:32,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:32,481 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:32,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:32,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:32,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:32,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:32,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:32,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:32,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:32,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:32,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:32,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:32,483 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:32,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:32,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:32,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:32,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:32,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:32,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:32,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:32,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:32,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:32,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:32,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:32,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:32,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:32,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:32,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:32,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:32,563 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:32,564 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:32,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-23 13:00:32,634 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a31d5a3/a1d116dc8f3f4c3d883871df6209a51e/FLAGee8d89343 [2018-11-23 13:00:33,164 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:33,166 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-23 13:00:33,180 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a31d5a3/a1d116dc8f3f4c3d883871df6209a51e/FLAGee8d89343 [2018-11-23 13:00:33,467 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a31d5a3/a1d116dc8f3f4c3d883871df6209a51e [2018-11-23 13:00:33,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:33,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:33,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:33,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:33,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:33,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:33" (1/1) ... [2018-11-23 13:00:33,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089b30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:33, skipping insertion in model container [2018-11-23 13:00:33,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:33" (1/1) ... [2018-11-23 13:00:33,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:33,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:34,011 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:34,029 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:34,107 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:34,176 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:34,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:34 WrapperNode [2018-11-23 13:00:34,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:34,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:34,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:34,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:34,256 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:34" (1/1) ... [2018-11-23 13:00:34,272 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:34" (1/1) ... [2018-11-23 13:00:34,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:34,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:34,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:34,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:34,291 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:34" (1/1) ... [2018-11-23 13:00:34,292 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:34" (1/1) ... [2018-11-23 13:00:34,295 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:34" (1/1) ... [2018-11-23 13:00:34,295 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:34" (1/1) ... [2018-11-23 13:00:34,307 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:34" (1/1) ... [2018-11-23 13:00:34,313 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:34" (1/1) ... [2018-11-23 13:00:34,315 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:34" (1/1) ... [2018-11-23 13:00:34,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:34,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:34,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:34,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:34,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:34" (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:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:34,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:34,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:35,106 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:35,106 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:00:35,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:35 BoogieIcfgContainer [2018-11-23 13:00:35,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:35,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:35,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:35,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:35,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:33" (1/3) ... [2018-11-23 13:00:35,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4157d18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:35, skipping insertion in model container [2018-11-23 13:00:35,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:34" (2/3) ... [2018-11-23 13:00:35,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4157d18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:35, skipping insertion in model container [2018-11-23 13:00:35,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:35" (3/3) ... [2018-11-23 13:00:35,117 INFO L112 eAbstractionObserver]: Analyzing ICFG min_max_true-unreach-call.i [2018-11-23 13:00:35,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:35,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 13:00:35,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 13:00:35,193 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:35,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:35,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:35,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:35,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:35,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:35,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:35,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:35,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 13:00:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:00:35,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:35,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:35,226 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:35,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -488073340, now seen corresponding path program 1 times [2018-11-23 13:00:35,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:35,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:35,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 13:00:35,411 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:35,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 13:00:35,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2018-11-23 13:00:35,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret12 := main(); {28#true} is VALID [2018-11-23 13:00:35,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~l~0.base, ~l~0.offset := 0, 0;~min~0 := 2147483647;~max~0 := -2147483647; {28#true} is VALID [2018-11-23 13:00:35,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 13:00:35,414 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:35,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem9 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {29#false} is VALID [2018-11-23 13:00:35,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume #t~mem9 < ~min~0;havoc #t~mem9; {29#false} is VALID [2018-11-23 13:00:35,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 13:00:35,418 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:35,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:35,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:35,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:00:35,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:35,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:35,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:35,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:35,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:35,514 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 13:00:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:35,796 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 13:00:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:35,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:00:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:00:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:00:35,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 13:00:35,947 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:35,959 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:00:35,960 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:00:35,963 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:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:00:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:00:36,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:36,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:36,016 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:36,020 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:00:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:00:36,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:36,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:36,021 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:36,021 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:00:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:36,025 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:00:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:00:36,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:36,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:36,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:36,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:00:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 13:00:36,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2018-11-23 13:00:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:36,031 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 13:00:36,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:00:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:00:36,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:36,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:36,032 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:36,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1459194737, now seen corresponding path program 1 times [2018-11-23 13:00:36,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:36,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:36,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:36,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {147#true} is VALID [2018-11-23 13:00:36,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {147#true} is VALID [2018-11-23 13:00:36,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2018-11-23 13:00:36,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #65#return; {147#true} is VALID [2018-11-23 13:00:36,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret12 := main(); {147#true} is VALID [2018-11-23 13:00:36,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {147#true} ~l~0.base, ~l~0.offset := 0, 0;~min~0 := 2147483647;~max~0 := -2147483647; {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:36,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:36,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} assume !(0 != #t~nondet2);havoc #t~nondet2; {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} is VALID [2018-11-23 13:00:36,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {149#(and (= 0 main_~l~0.base) (= 0 main_~l~0.offset))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {150#(and (= main_~i~0.base 0) (= 0 main_~i~0.offset))} is VALID [2018-11-23 13:00:36,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {150#(and (= main_~i~0.base 0) (= 0 main_~i~0.offset))} assume !!(~i~0.base != 0 || ~i~0.offset != 0);call #t~mem9 := read~int(~i~0.base, 4 + ~i~0.offset, 4); {148#false} is VALID [2018-11-23 13:00:36,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {148#false} assume #t~mem9 < ~min~0;havoc #t~mem9; {148#false} is VALID [2018-11-23 13:00:36,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {148#false} assume !false; {148#false} is VALID [2018-11-23 13:00:36,301 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:36,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:36,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:36,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:00:36,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:36,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:36,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:36,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:36,329 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2018-11-23 13:00:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:36,620 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 13:00:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:36,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:00:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 13:00:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 13:00:36,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 13:00:36,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:36,992 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:00:36,992 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:00:36,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:00:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:00:37,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:37,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:00:37,005 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:00:37,006 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:00:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:37,009 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 13:00:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:00:37,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:37,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:00:37,010 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:00:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:37,012 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 13:00:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:00:37,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:37,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:37,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:37,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:00:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 13:00:37,016 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2018-11-23 13:00:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:37,016 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 13:00:37,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:00:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:00:37,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:37,018 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:37,018 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:37,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -30554087, now seen corresponding path program 1 times [2018-11-23 13:00:37,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:37,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:37,333 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:37,339 INFO L168 Benchmark]: Toolchain (without parser) took 3861.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -656.0 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:37,341 INFO L168 Benchmark]: CDTParser took 0.20 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:37,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.49 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:37,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:37,344 INFO L168 Benchmark]: Boogie Preprocessor took 36.16 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:37,344 INFO L168 Benchmark]: RCFGBuilder took 788.25 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:37,345 INFO L168 Benchmark]: TraceAbstraction took 2229.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:37,352 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.20 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 696.49 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 105.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.16 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 788.25 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2229.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.8 MB). Peak memory consumption was 91.8 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...