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/list_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:21,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:21,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:21,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:21,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:21,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:21,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:21,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:21,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:21,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:21,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:21,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:21,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:21,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:21,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:21,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:21,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:21,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:21,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:21,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:21,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:21,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:21,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:21,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:21,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:21,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:21,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:21,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:21,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:21,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:21,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:21,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:21,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:21,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:21,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:21,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:21,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:52:21,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:21,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:21,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:21,931 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:21,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:21,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:21,935 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:21,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:21,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:21,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:21,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:21,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:21,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:21,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:21,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:21,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:21,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:21,938 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:21,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:21,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:21,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:21,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:21,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:21,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:21,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:21,941 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:21,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:22,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:22,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:22,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:22,023 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:22,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:22,085 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfa50f67/a3504916d6cd4a2b868910527b4b56d4/FLAG6c84ebd21 [2018-11-23 12:52:22,680 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:52:22,680 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:22,701 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfa50f67/a3504916d6cd4a2b868910527b4b56d4/FLAG6c84ebd21 [2018-11-23 12:52:22,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfa50f67/a3504916d6cd4a2b868910527b4b56d4 [2018-11-23 12:52:22,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:52:22,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:52:22,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:22,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:52:22,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:52:22,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:22" (1/1) ... [2018-11-23 12:52:22,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33755a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:22, skipping insertion in model container [2018-11-23 12:52:22,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:22" (1/1) ... [2018-11-23 12:52:22,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:52:22,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:52:23,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:23,372 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:52:23,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:23,509 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:52:23,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23 WrapperNode [2018-11-23 12:52:23,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:23,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:23,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:52:23,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:52:23,521 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:52:23" (1/1) ... [2018-11-23 12:52:23,620 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:52:23" (1/1) ... [2018-11-23 12:52:23,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:23,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:52:23,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:52:23,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:52:23,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (1/1) ... [2018-11-23 12:52:23,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:52:23,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:52:23,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:52:23,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:52:23,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (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:52:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:52:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:52:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:52:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:52:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:52:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:52:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:52:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:52:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:52:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:52:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:52:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:52:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:52:24,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:52:24,634 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:52:24,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:24 BoogieIcfgContainer [2018-11-23 12:52:24,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:52:24,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:52:24,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:52:24,639 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:52:24,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:22" (1/3) ... [2018-11-23 12:52:24,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7aab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:24, skipping insertion in model container [2018-11-23 12:52:24,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:23" (2/3) ... [2018-11-23 12:52:24,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7aab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:24, skipping insertion in model container [2018-11-23 12:52:24,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:24" (3/3) ... [2018-11-23 12:52:24,643 INFO L112 eAbstractionObserver]: Analyzing ICFG list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:24,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:52:24,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:52:24,679 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:52:24,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:52:24,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:52:24,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:52:24,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:52:24,717 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:52:24,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:52:24,717 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:52:24,718 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:52:24,718 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:52:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 12:52:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:52:24,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:24,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:24,748 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:24,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1232701293, now seen corresponding path program 1 times [2018-11-23 12:52:24,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:24,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:24,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 12:52:24,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 12:52:24,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 12:52:24,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #99#return; {38#true} is VALID [2018-11-23 12:52:24,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret12 := main(); {38#true} is VALID [2018-11-23 12:52:24,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {38#true} is VALID [2018-11-23 12:52:24,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {38#true} is VALID [2018-11-23 12:52:24,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {38#true} is VALID [2018-11-23 12:52:24,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 12:52:24,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 12:52:24,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#false} is VALID [2018-11-23 12:52:24,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 12:52:24,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 12:52:24,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {39#false} is VALID [2018-11-23 12:52:24,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume 3 != #t~mem11;havoc #t~mem11; {39#false} is VALID [2018-11-23 12:52:24,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 12:52:24,929 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:52:24,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:24,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:52:24,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:52:24,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:24,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:52:25,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:25,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:52:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:52:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:52:25,022 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 12:52:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:25,174 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-23 12:52:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:52:25,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:52:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-23 12:52:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-23 12:52:25,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-23 12:52:25,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:25,483 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:52:25,484 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:52:25,487 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:52:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:52:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:52:25,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:25,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:52:25,548 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:52:25,548 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:52:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:25,553 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:52:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:52:25,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:25,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:25,554 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:52:25,554 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:52:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:25,558 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:52:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:52:25,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:25,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:25,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:25,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:52:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:52:25,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-23 12:52:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:25,566 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:52:25,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:52:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:52:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:52:25,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:25,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:25,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:25,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash -921255067, now seen corresponding path program 1 times [2018-11-23 12:52:25,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:25,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:25,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2018-11-23 12:52:25,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {194#true} is VALID [2018-11-23 12:52:25,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-23 12:52:25,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #99#return; {194#true} is VALID [2018-11-23 12:52:25,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret12 := main(); {194#true} is VALID [2018-11-23 12:52:25,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {194#true} is VALID [2018-11-23 12:52:25,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {194#true} is VALID [2018-11-23 12:52:25,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:25,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:25,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:25,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:25,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:25,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {196#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:25,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:25,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem7);havoc #t~mem7; {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:25,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:25,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem9);havoc #t~mem9; {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:25,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {197#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {198#(= 3 |main_#t~mem11|)} is VALID [2018-11-23 12:52:25,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#(= 3 |main_#t~mem11|)} assume 3 != #t~mem11;havoc #t~mem11; {195#false} is VALID [2018-11-23 12:52:25,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {195#false} assume !false; {195#false} is VALID [2018-11-23 12:52:25,886 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:52:25,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:25,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:25,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:52:25,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:25,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:26,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:26,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:26,155 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 12:52:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:26,642 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 12:52:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:26,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:52:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:52:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:52:26,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2018-11-23 12:52:26,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:26,780 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:52:26,780 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:52:26,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:52:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-11-23 12:52:26,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:26,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 34 states. [2018-11-23 12:52:26,812 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 34 states. [2018-11-23 12:52:26,812 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 34 states. [2018-11-23 12:52:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:26,816 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 12:52:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:52:26,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:26,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:26,817 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 46 states. [2018-11-23 12:52:26,818 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 46 states. [2018-11-23 12:52:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:26,822 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 12:52:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:52:26,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:26,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:26,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:26,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:52:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 12:52:26,826 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2018-11-23 12:52:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:26,826 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 12:52:26,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:52:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:52:26,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:26,828 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:26,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:26,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash -514179872, now seen corresponding path program 1 times [2018-11-23 12:52:26,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:27,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {398#true} is VALID [2018-11-23 12:52:27,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {398#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {398#true} is VALID [2018-11-23 12:52:27,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2018-11-23 12:52:27,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #99#return; {398#true} is VALID [2018-11-23 12:52:27,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret12 := main(); {398#true} is VALID [2018-11-23 12:52:27,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {398#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {398#true} is VALID [2018-11-23 12:52:27,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {398#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {398#true} is VALID [2018-11-23 12:52:27,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {398#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:27,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:27,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume !(2 == #t~mem7);havoc #t~mem7; {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:27,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {401#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {402#(= |main_#t~mem9| 3)} is VALID [2018-11-23 12:52:27,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#(= |main_#t~mem9| 3)} assume !!(1 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {399#false} is VALID [2018-11-23 12:52:27,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {399#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {399#false} is VALID [2018-11-23 12:52:27,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {399#false} assume !(1 == #t~mem9);havoc #t~mem9; {399#false} is VALID [2018-11-23 12:52:27,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {399#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {399#false} is VALID [2018-11-23 12:52:27,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {399#false} assume 3 != #t~mem11;havoc #t~mem11; {399#false} is VALID [2018-11-23 12:52:27,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {399#false} assume !false; {399#false} is VALID [2018-11-23 12:52:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:27,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:27,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:27,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:52:27,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:27,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:27,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:27,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:27,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:27,104 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2018-11-23 12:52:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:27,432 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:52:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:27,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:52:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 12:52:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 12:52:27,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-23 12:52:27,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:27,531 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:52:27,531 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:52:27,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:52:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-23 12:52:27,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:27,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:27,559 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:27,559 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:27,563 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:52:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:52:27,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:27,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:27,564 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2018-11-23 12:52:27,564 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2018-11-23 12:52:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:27,567 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:52:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:52:27,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:27,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:27,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:27,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:52:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:52:27,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2018-11-23 12:52:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:27,571 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:52:27,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:52:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:52:27,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:27,573 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:27,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:27,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash 510523104, now seen corresponding path program 1 times [2018-11-23 12:52:27,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:27,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:27,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-23 12:52:27,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {598#true} is VALID [2018-11-23 12:52:27,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-23 12:52:27,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #99#return; {598#true} is VALID [2018-11-23 12:52:27,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret12 := main(); {598#true} is VALID [2018-11-23 12:52:27,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {598#true} is VALID [2018-11-23 12:52:27,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {598#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {598#true} is VALID [2018-11-23 12:52:27,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {598#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:27,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {600#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {601#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:27,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {601#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {602#(= |main_#t~mem7| 3)} is VALID [2018-11-23 12:52:27,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {602#(= |main_#t~mem7| 3)} assume !!(2 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {599#false} is VALID [2018-11-23 12:52:27,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {599#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {599#false} is VALID [2018-11-23 12:52:27,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#false} assume !(2 == #t~mem7);havoc #t~mem7; {599#false} is VALID [2018-11-23 12:52:27,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {599#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {599#false} is VALID [2018-11-23 12:52:27,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} assume !(1 == #t~mem9);havoc #t~mem9; {599#false} is VALID [2018-11-23 12:52:27,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {599#false} is VALID [2018-11-23 12:52:27,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {599#false} assume 3 != #t~mem11;havoc #t~mem11; {599#false} is VALID [2018-11-23 12:52:27,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-23 12:52:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:27,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:27,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:27,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:52:27,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:27,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:27,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:27,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:27,745 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2018-11-23 12:52:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:28,096 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:52:28,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:28,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:52:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 12:52:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 12:52:28,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-23 12:52:28,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:28,232 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:52:28,232 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:52:28,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:52:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-11-23 12:52:28,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:28,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 29 states. [2018-11-23 12:52:28,255 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 29 states. [2018-11-23 12:52:28,255 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 29 states. [2018-11-23 12:52:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:28,259 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:52:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:52:28,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:28,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:28,260 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 41 states. [2018-11-23 12:52:28,261 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 41 states. [2018-11-23 12:52:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:28,263 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:52:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:52:28,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:28,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:28,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:28,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:52:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:52:28,266 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2018-11-23 12:52:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:28,267 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:52:28,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:52:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:52:28,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:28,268 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:28,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:28,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 435761036, now seen corresponding path program 1 times [2018-11-23 12:52:28,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:28,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:28,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:28,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:28,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {789#true} call ULTIMATE.init(); {789#true} is VALID [2018-11-23 12:52:28,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {789#true} is VALID [2018-11-23 12:52:28,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {789#true} assume true; {789#true} is VALID [2018-11-23 12:52:28,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} #99#return; {789#true} is VALID [2018-11-23 12:52:28,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {789#true} call #t~ret12 := main(); {789#true} is VALID [2018-11-23 12:52:28,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {789#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {791#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:28,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {791#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {791#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:28,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {791#(= (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; {792#(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:52:28,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(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; {792#(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:52:28,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(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; {792#(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:52:28,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(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~nondet4 && #t~nondet4 <= 2147483647; {792#(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:52:28,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {792#(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~nondet4);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:52:28,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:52:28,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:28,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:28,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:28,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {794#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {795#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:28,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {796#(= |main_#t~mem7| 2)} is VALID [2018-11-23 12:52:28,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {796#(= |main_#t~mem7| 2)} assume !(2 == #t~mem7);havoc #t~mem7; {790#false} is VALID [2018-11-23 12:52:28,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {790#false} is VALID [2018-11-23 12:52:28,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {790#false} assume !(1 == #t~mem9);havoc #t~mem9; {790#false} is VALID [2018-11-23 12:52:28,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {790#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {790#false} is VALID [2018-11-23 12:52:28,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {790#false} assume 3 != #t~mem11;havoc #t~mem11; {790#false} is VALID [2018-11-23 12:52:28,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {790#false} assume !false; {790#false} is VALID [2018-11-23 12:52:28,601 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:52:28,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:52:28,602 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:52:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:28,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:52:28,763 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:52:28,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:28,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:28,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:52:28,778 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:28,778 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (= (store |v_#valid_13| main_~a~0.base 1) |#valid|) [2018-11-23 12:52:28,779 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:52:28,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:28,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:28,864 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:52:28,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:28,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:52:28,932 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:52:28,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:28,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,032 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:52:29,033 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:52:29,049 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:29,049 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |v_#valid_14|]. (and (= (select |v_#valid_14| main_~t~0.base) 0) (= (select |v_#valid_14| main_~p~0.base) 1) (= (store |v_#memory_int_16| main_~p~0.base (store (select |v_#memory_int_16| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:52:29,050 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:52:29,122 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:52:29,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:29,133 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:52:29,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:52:29,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:52:29,391 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:52:29,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,411 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:52:29,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:52:29,416 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:29,416 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (select (select |v_#memory_int_18| main_~p~0.base) main_~p~0.offset) 2) (= (store |v_#memory_int_18| v_main_~p~0.base_18 (store (select |v_#memory_int_18| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|)) [2018-11-23 12:52:29,417 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:52:29,515 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:52:29,523 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:52:29,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,542 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:52:29,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:29,555 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:52:29,570 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:29,571 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (= |main_#t~mem7| .cse0) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 .cse0))) [2018-11-23 12:52:29,571 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem7|) [2018-11-23 12:52:29,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {789#true} call ULTIMATE.init(); {789#true} is VALID [2018-11-23 12:52:29,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {789#true} is VALID [2018-11-23 12:52:29,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {789#true} assume true; {789#true} is VALID [2018-11-23 12:52:29,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} #99#return; {789#true} is VALID [2018-11-23 12:52:29,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {789#true} call #t~ret12 := main(); {789#true} is VALID [2018-11-23 12:52:29,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {789#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {791#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:29,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {791#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {791#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:29,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {791#(= (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; {792#(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:52:29,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(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; {792#(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:52:29,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(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; {792#(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:52:29,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(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~nondet4 && #t~nondet4 <= 2147483647; {792#(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:52:29,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {792#(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~nondet4);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:52:29,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:52:29,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {793#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:29,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:29,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:29,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {839#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {849#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-23 12:52:29,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {849#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {796#(= |main_#t~mem7| 2)} is VALID [2018-11-23 12:52:29,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {796#(= |main_#t~mem7| 2)} assume !(2 == #t~mem7);havoc #t~mem7; {790#false} is VALID [2018-11-23 12:52:29,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {790#false} is VALID [2018-11-23 12:52:29,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {790#false} assume !(1 == #t~mem9);havoc #t~mem9; {790#false} is VALID [2018-11-23 12:52:29,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {790#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {790#false} is VALID [2018-11-23 12:52:29,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {790#false} assume 3 != #t~mem11;havoc #t~mem11; {790#false} is VALID [2018-11-23 12:52:29,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {790#false} assume !false; {790#false} is VALID [2018-11-23 12:52:29,632 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:52:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:52:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:52:29,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:52:29,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:29,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:52:29,717 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:52:29,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:52:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:52:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:52:29,719 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 10 states. [2018-11-23 12:52:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:30,710 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:52:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:52:30,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:52:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2018-11-23 12:52:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2018-11-23 12:52:30,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2018-11-23 12:52:30,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:30,858 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:52:30,858 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:52:30,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:52:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:52:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-11-23 12:52:30,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:30,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2018-11-23 12:52:30,902 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2018-11-23 12:52:30,903 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2018-11-23 12:52:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:30,906 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:52:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:52:30,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:30,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:30,907 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2018-11-23 12:52:30,907 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2018-11-23 12:52:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:30,910 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:52:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:52:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:30,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:30,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:52:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 12:52:30,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2018-11-23 12:52:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:30,913 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 12:52:30,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:52:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:52:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:52:30,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:30,915 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:30,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:30,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1299162700, now seen corresponding path program 1 times [2018-11-23 12:52:30,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:30,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:31,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-23 12:52:31,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1085#true} is VALID [2018-11-23 12:52:31,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 12:52:31,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #99#return; {1085#true} is VALID [2018-11-23 12:52:31,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret12 := main(); {1085#true} is VALID [2018-11-23 12:52:31,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {1085#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1087#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:31,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {1087#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1087#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:31,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {1087#(= (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; {1088#(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:52:31,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1088#(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; {1088#(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:52:31,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {1088#(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; {1089#(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:52:31,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {1089#(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); {1089#(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:52:31,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {1089#(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; {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:31,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:31,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:31,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:31,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:52:31,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:31,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:31,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem7);havoc #t~mem7; {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:31,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {1091#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1092#(= |main_#t~mem9| 1)} is VALID [2018-11-23 12:52:31,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {1092#(= |main_#t~mem9| 1)} assume !(1 == #t~mem9);havoc #t~mem9; {1086#false} is VALID [2018-11-23 12:52:31,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {1086#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1086#false} is VALID [2018-11-23 12:52:31,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {1086#false} assume 3 != #t~mem11;havoc #t~mem11; {1086#false} is VALID [2018-11-23 12:52:31,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-23 12:52:31,128 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:52:31,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:52:31,129 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:52:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:31,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:52:31,327 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:52:31,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:52:31,370 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:31,370 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= |#valid| (store |v_#valid_15| main_~a~0.base 1)) [2018-11-23 12:52:31,370 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:52:31,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:31,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:31,412 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:52:31,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:52:31,440 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:52:31,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,467 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:52:31,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:52:31,471 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:31,471 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, |v_#valid_16|]. (and (= 1 (select |v_#valid_16| main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_19| main_~p~0.base (store (select |v_#memory_int_19| main_~p~0.base) main_~p~0.offset 1))) (= 0 (select |v_#valid_16| main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:52:31,472 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:52:31,520 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:52:31,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:52:31,538 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:52:31,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:52:31,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:52:31,638 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:52:31,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,658 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:52:31,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:52:31,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:31,662 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |v_#memory_int_21| main_~p~0.base) main_~p~0.offset) 1) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (store |v_#memory_int_21| v_main_~p~0.base_20 (store (select |v_#memory_int_21| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)) |#memory_int|)) [2018-11-23 12:52:31,663 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:52:31,739 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:52:31,748 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:52:31,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,797 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:52:31,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:31,807 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:52:31,809 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:31,810 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= |main_#t~mem9| .cse0) (= 1 .cse0))) [2018-11-23 12:52:31,810 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem9|) [2018-11-23 12:52:31,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-23 12:52:31,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1085#true} is VALID [2018-11-23 12:52:31,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 12:52:31,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #99#return; {1085#true} is VALID [2018-11-23 12:52:31,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret12 := main(); {1085#true} is VALID [2018-11-23 12:52:31,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {1085#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1087#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:31,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {1087#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1087#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:52:31,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {1087#(= (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; {1088#(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:52:31,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {1088#(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; {1088#(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:52:31,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1088#(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; {1089#(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:52:31,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1089#(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); {1089#(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:52:31,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {1089#(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; {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:31,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:31,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:31,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:31,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:52:31,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {1129#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:52:31,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:52:31,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume !(2 == #t~mem7);havoc #t~mem7; {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:52:31,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {1145#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1092#(= |main_#t~mem9| 1)} is VALID [2018-11-23 12:52:31,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {1092#(= |main_#t~mem9| 1)} assume !(1 == #t~mem9);havoc #t~mem9; {1086#false} is VALID [2018-11-23 12:52:31,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {1086#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1086#false} is VALID [2018-11-23 12:52:31,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {1086#false} assume 3 != #t~mem11;havoc #t~mem11; {1086#false} is VALID [2018-11-23 12:52:31,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-23 12:52:31,841 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:52:31,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:52:31,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:52:31,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:52:31,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:31,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:52:31,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:31,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:52:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:52:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:52:31,907 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2018-11-23 12:52:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:33,154 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 12:52:33,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:52:33,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:52:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:52:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 12:52:33,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 12:52:33,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:33,327 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:52:33,327 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:52:33,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:52:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:52:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-11-23 12:52:33,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:33,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2018-11-23 12:52:33,518 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2018-11-23 12:52:33,518 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2018-11-23 12:52:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:33,522 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 12:52:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-23 12:52:33,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:33,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:33,523 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2018-11-23 12:52:33,523 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2018-11-23 12:52:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:33,526 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 12:52:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-23 12:52:33,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:33,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:33,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:33,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:52:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 12:52:33,529 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-11-23 12:52:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:33,529 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 12:52:33,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:52:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:52:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:52:33,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:33,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:33,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:33,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1067059897, now seen corresponding path program 1 times [2018-11-23 12:52:33,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:33,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:33,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:33,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:33,758 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:52:33,762 INFO L168 Benchmark]: Toolchain (without parser) took 10849.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 831.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.0 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:33,764 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:33,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.08 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:52:33,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 676.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -765.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:33,766 INFO L168 Benchmark]: Boogie Preprocessor took 45.93 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:33,766 INFO L168 Benchmark]: RCFGBuilder took 957.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:33,767 INFO L168 Benchmark]: TraceAbstraction took 9125.13 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 154.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -69.6 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:33,771 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 595.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 120.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 676.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -765.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.93 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 957.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9125.13 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 154.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -69.6 MB). Peak memory consumption was 85.0 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...