java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:24,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:24,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:24,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:24,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:24,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:24,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:24,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:24,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:24,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:24,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:24,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:24,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:24,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:24,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:24,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:24,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:24,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:24,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:24,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:24,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:24,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:24,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:24,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:24,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:24,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:24,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:24,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:24,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:24,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:24,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:24,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:24,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:24,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:24,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:24,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:24,364 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:24,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:24,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:24,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:24,385 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:24,386 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:24,386 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:24,386 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:24,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:24,386 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:24,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:24,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:24,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:24,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:24,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:24,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:24,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:24,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:24,390 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:24,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:24,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:24,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:24,391 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:24,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:24,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:24,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:24,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:24,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:24,392 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:24,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:24,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:24,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:24,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:24,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:24,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:24,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:24,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:24,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:24,535 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33995e8a/b76ad6c2798947cf809f46d127da5a82/FLAG2e0fcea06 [2018-11-23 12:53:25,086 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:25,087 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:25,107 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33995e8a/b76ad6c2798947cf809f46d127da5a82/FLAG2e0fcea06 [2018-11-23 12:53:25,352 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33995e8a/b76ad6c2798947cf809f46d127da5a82 [2018-11-23 12:53:25,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:25,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:25,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:25,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:25,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:25,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:25,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a97119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25, skipping insertion in model container [2018-11-23 12:53:25,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:25,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:25,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:25,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:25,819 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:25,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:25,973 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:25,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25 WrapperNode [2018-11-23 12:53:25,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:25,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:25,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:25,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:26,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:26,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:26,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:26,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:26,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:26,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:26,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:26,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:26,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:26,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:26,184 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:26,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:26,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:26,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:26,791 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:26,792 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:53:26,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:26 BoogieIcfgContainer [2018-11-23 12:53:26,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:26,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:26,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:26,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:26,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:25" (1/3) ... [2018-11-23 12:53:26,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e3cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:26, skipping insertion in model container [2018-11-23 12:53:26,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25" (2/3) ... [2018-11-23 12:53:26,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e3cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:26, skipping insertion in model container [2018-11-23 12:53:26,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:26" (3/3) ... [2018-11-23 12:53:26,802 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:26,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:26,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:26,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:26,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:26,877 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:26,877 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:26,878 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:26,878 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:26,878 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:26,878 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:26,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:26,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 12:53:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:53:26,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:26,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:26,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:26,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1541418343, now seen corresponding path program 1 times [2018-11-23 12:53:26,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:26,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:26,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:27,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 12:53:27,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 12:53:27,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 12:53:27,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #66#return; {30#true} is VALID [2018-11-23 12:53:27,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret6 := main(); {30#true} is VALID [2018-11-23 12:53:27,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {30#true} is VALID [2018-11-23 12:53:27,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {30#true} is VALID [2018-11-23 12:53:27,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {30#true} is VALID [2018-11-23 12:53:27,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 12:53:27,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {31#false} is VALID [2018-11-23 12:53:27,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {31#false} is VALID [2018-11-23 12:53:27,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume 1 != #t~mem4;havoc #t~mem4; {31#false} is VALID [2018-11-23 12:53:27,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 12:53:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:27,130 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:53:27,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:27,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:27,233 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 12:53:27,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:27,246 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 12:53:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,737 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:53:27,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:27,738 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:53:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:53:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:53:27,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 12:53:27,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:27,897 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:53:27,897 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:53:27,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:53:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:53:27,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:27,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:27,944 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:27,944 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,948 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:53:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:53:27,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:27,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:27,949 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:27,949 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,953 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:53:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:53:27,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:27,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:27,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:27,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:53:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:53:27,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:53:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:27,959 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:53:27,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:53:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:53:27,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:27,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:27,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:27,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash 96690808, now seen corresponding path program 1 times [2018-11-23 12:53:27,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:27,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:28,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {143#true} is VALID [2018-11-23 12:53:28,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {143#true} is VALID [2018-11-23 12:53:28,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2018-11-23 12:53:28,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #66#return; {143#true} is VALID [2018-11-23 12:53:28,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret6 := main(); {143#true} is VALID [2018-11-23 12:53:28,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {143#true} is VALID [2018-11-23 12:53:28,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {143#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {143#true} is VALID [2018-11-23 12:53:28,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:28,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:28,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:28,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {146#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:28,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {146#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {147#(= |main_#t~mem4| 1)} is VALID [2018-11-23 12:53:28,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {147#(= |main_#t~mem4| 1)} assume 1 != #t~mem4;havoc #t~mem4; {144#false} is VALID [2018-11-23 12:53:28,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {144#false} assume !false; {144#false} is VALID [2018-11-23 12:53:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:28,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:28,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:53:28,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:28,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:28,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:28,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:28,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:28,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:28,447 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-23 12:53:28,904 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 12:53:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,094 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:53:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:29,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:53:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:53:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:53:29,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-23 12:53:29,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:29,166 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:53:29,167 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:53:29,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:53:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 12:53:29,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:29,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 12:53:29,217 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 12:53:29,217 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 12:53:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,220 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:53:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:53:29,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:29,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:29,222 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 12:53:29,222 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 12:53:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,225 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:53:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:53:29,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:29,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:29,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:29,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:53:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:53:29,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2018-11-23 12:53:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:29,229 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:53:29,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:53:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:53:29,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:29,230 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:29,231 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:29,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:29,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1402379173, now seen corresponding path program 1 times [2018-11-23 12:53:29,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:29,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:53:29,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:53:29,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:53:29,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #66#return; {289#true} is VALID [2018-11-23 12:53:29,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2018-11-23 12:53:29,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:53:29,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:53:29,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:29,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:29,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:29,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem4);havoc #t~mem4; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:29,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {290#false} is VALID [2018-11-23 12:53:29,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 1 != #t~mem4;havoc #t~mem4; {290#false} is VALID [2018-11-23 12:53:29,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:53:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:29,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:29,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:53:29,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:29,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:29,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:29,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:53:29,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:29,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:53:29,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 12:53:30,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:53:30,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:53:30,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:30,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:30,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:53:30,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:53:30,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:30,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:30,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:30,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 12:53:30,128 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:30,128 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4))) (and (= .cse0 0) (= 0 .cse1) (= main_~p~0.base .cse1) (= .cse0 main_~p~0.offset))) [2018-11-23 12:53:30,129 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 12:53:30,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:53:30,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:53:30,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:53:30,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #66#return; {289#true} is VALID [2018-11-23 12:53:30,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2018-11-23 12:53:30,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:53:30,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:53:30,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:30,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:30,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem4);havoc #t~mem4; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:30,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:30,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {290#false} is VALID [2018-11-23 12:53:30,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 1 != #t~mem4;havoc #t~mem4; {290#false} is VALID [2018-11-23 12:53:30,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:53:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:30,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:30,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:53:30,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:53:30,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:30,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:30,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:30,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:30,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:30,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:30,215 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 12:53:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,532 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:53:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:30,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:53:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:53:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:53:30,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 12:53:30,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:30,603 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:53:30,603 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:30,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:53:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 12:53:30,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:30,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2018-11-23 12:53:30,621 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2018-11-23 12:53:30,622 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2018-11-23 12:53:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,625 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:53:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:53:30,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,626 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2018-11-23 12:53:30,626 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2018-11-23 12:53:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,629 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:53:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:53:30,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:30,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:53:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:53:30,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:53:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:30,632 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:53:30,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:53:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:53:30,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:30,634 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:30,634 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:30,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1367734753, now seen corresponding path program 1 times [2018-11-23 12:53:30,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:30,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:30,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2018-11-23 12:53:30,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {478#true} is VALID [2018-11-23 12:53:30,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2018-11-23 12:53:30,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #66#return; {478#true} is VALID [2018-11-23 12:53:30,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret6 := main(); {478#true} is VALID [2018-11-23 12:53:30,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {478#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {480#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:30,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {480#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:30,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {481#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {481#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {481#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {482#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {482#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {482#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:30,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:30,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:30,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {484#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:30,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {485#(= |main_#t~mem4| 1)} is VALID [2018-11-23 12:53:30,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {485#(= |main_#t~mem4| 1)} assume 1 != #t~mem4;havoc #t~mem4; {479#false} is VALID [2018-11-23 12:53:30,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {479#false} assume !false; {479#false} is VALID [2018-11-23 12:53:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:30,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:30,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:53:30,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:30,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:31,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 12:53:31,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:53:31,051 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:31,051 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_11|]. (and (= |#valid| (store |v_#valid_11| main_~a~0.base 1)) (= main_~a~0.offset 0)) [2018-11-23 12:53:31,051 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0)) [2018-11-23 12:53:31,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:31,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:31,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:53:31,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:31,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:53:31,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 12:53:31,220 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:31,221 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, |v_#valid_12|]. (and (= (store |v_#memory_int_11| main_~p~0.base (store (select |v_#memory_int_11| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= main_~a~0.base main_~p~0.base) (= (select |v_#valid_12| main_~a~0.base) 1) (= main_~a~0.offset 0) (= (select |v_#valid_12| main_~t~0.base) 0) (= main_~a~0.offset main_~p~0.offset)) [2018-11-23 12:53:31,221 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset)) [2018-11-23 12:53:31,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:53:31,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:31,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:53:31,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 12:53:31,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 12:53:31,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 12:53:31,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:31,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:53:31,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:53:31,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-23 12:53:31,446 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:31,446 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, v_main_~p~0.base_14, v_main_~p~0.offset_14]. (and (= (store |v_#memory_int_13| v_main_~p~0.base_14 (let ((.cse0 (+ v_main_~p~0.offset_14 4))) (store (store (select |v_#memory_int_13| v_main_~p~0.base_14) v_main_~p~0.offset_14 1) .cse0 (select (select |#memory_int| v_main_~p~0.base_14) .cse0)))) |#memory_int|) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= main_~p~0.offset 0) (= (select (select |v_#memory_int_13| main_~p~0.base) 0) 1)) [2018-11-23 12:53:31,447 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_14, v_main_~p~0.offset_14]. (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= main_~p~0.offset 0)) [2018-11-23 12:53:31,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:53:31,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:53:31,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:53:31,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:31,799 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:31,802 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:31,802 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_14, v_main_~p~0.offset_14, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (= 1 .cse0) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= |main_#t~mem4| .cse0))) [2018-11-23 12:53:31,802 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem4|) [2018-11-23 12:53:31,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2018-11-23 12:53:31,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {478#true} is VALID [2018-11-23 12:53:31,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2018-11-23 12:53:31,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #66#return; {478#true} is VALID [2018-11-23 12:53:31,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret6 := main(); {478#true} is VALID [2018-11-23 12:53:31,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {478#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {504#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:53:31,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {504#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:53:31,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {511#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:31,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {511#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:31,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {511#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {518#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:31,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {518#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {518#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:31,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {518#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:31,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:31,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:31,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {525#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {535#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= main_~p~0.offset 0) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} is VALID [2018-11-23 12:53:31,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {535#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= main_~p~0.offset 0) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {485#(= |main_#t~mem4| 1)} is VALID [2018-11-23 12:53:31,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {485#(= |main_#t~mem4| 1)} assume 1 != #t~mem4;havoc #t~mem4; {479#false} is VALID [2018-11-23 12:53:31,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {479#false} assume !false; {479#false} is VALID [2018-11-23 12:53:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:31,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:31,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 12:53:31,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-11-23 12:53:31,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:31,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:53:31,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:31,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:53:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:53:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:53:31,956 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2018-11-23 12:53:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:32,936 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:53:32,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:53:32,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-11-23 12:53:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:53:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:53:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:53:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:53:32,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 12:53:33,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:33,019 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:53:33,019 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:53:33,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:53:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:53:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 12:53:33,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:33,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 27 states. [2018-11-23 12:53:33,076 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 27 states. [2018-11-23 12:53:33,076 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 27 states. [2018-11-23 12:53:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,079 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:53:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:53:33,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,080 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 35 states. [2018-11-23 12:53:33,080 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 35 states. [2018-11-23 12:53:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,082 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:53:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:53:33,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:33,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:53:33,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 12:53:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:33,086 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:53:33,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:53:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:53:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:53:33,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:33,087 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:33,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash 173525844, now seen corresponding path program 1 times [2018-11-23 12:53:33,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:33,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:33,415 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:53:33,420 INFO L168 Benchmark]: Toolchain (without parser) took 8057.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -285.9 MB). Peak memory consumption was 441.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,421 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:33,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,423 INFO L168 Benchmark]: Boogie Preprocessor took 33.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:33,424 INFO L168 Benchmark]: RCFGBuilder took 668.97 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 12:53:33,424 INFO L168 Benchmark]: TraceAbstraction took 6624.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 469.5 MB). Peak memory consumption was 469.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,429 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.26 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 610.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.77 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 668.97 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 6624.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 469.5 MB). Peak memory consumption was 469.5 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...