java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:39,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:39,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:39,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:39,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:39,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:39,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:39,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:40,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:40,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:40,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:40,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:40,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:40,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:40,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:40,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:40,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:40,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:40,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:40,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:40,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:40,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:40,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:40,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:40,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:40,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:40,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:40,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:40,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:40,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:40,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:40,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:40,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:40,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:40,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:40,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:40,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:40,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:40,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:40,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:40,081 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:40,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:40,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:40,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:40,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:40,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:40,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:40,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:40,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:40,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:40,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:40,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:40,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:40,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:40,085 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:40,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:40,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:40,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:40,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:40,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:40,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:40,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:40,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:40,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:40,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:40,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:40,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:40,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:40,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:40,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:40,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:40,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:40,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:40,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-23 13:00:40,222 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413508913/c37c3e1f7ca5436d8f0b29c1a8cb321e/FLAGdbde5ed3a [2018-11-23 13:00:40,797 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:40,798 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-23 13:00:40,814 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413508913/c37c3e1f7ca5436d8f0b29c1a8cb321e/FLAGdbde5ed3a [2018-11-23 13:00:41,068 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413508913/c37c3e1f7ca5436d8f0b29c1a8cb321e [2018-11-23 13:00:41,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:41,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:41,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:41,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:41,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:41,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7bc8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41, skipping insertion in model container [2018-11-23 13:00:41,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:41,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:41,566 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:41,580 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:41,646 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:41,716 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:41,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41 WrapperNode [2018-11-23 13:00:41,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:41,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:41,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:41,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:41,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:41,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:41,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:41,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:41,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... [2018-11-23 13:00:41,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:41,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:41,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:41,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:41,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:42,653 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:42,654 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:00:42,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:42 BoogieIcfgContainer [2018-11-23 13:00:42,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:42,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:42,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:42,659 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:42,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:41" (1/3) ... [2018-11-23 13:00:42,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:42, skipping insertion in model container [2018-11-23 13:00:42,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:41" (2/3) ... [2018-11-23 13:00:42,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:42, skipping insertion in model container [2018-11-23 13:00:42,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:42" (3/3) ... [2018-11-23 13:00:42,663 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-23 13:00:42,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:42,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:42,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:42,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:42,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:42,734 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:42,735 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:42,735 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:42,735 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:42,735 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:42,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:42,736 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:00:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:00:42,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:42,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:42,765 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:42,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1327309681, now seen corresponding path program 1 times [2018-11-23 13:00:42,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:42,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:42,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:42,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:00:42,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-23 13:00:42,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:00:42,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #57#return; {25#true} is VALID [2018-11-23 13:00:42,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret16 := main(); {25#true} is VALID [2018-11-23 13:00:42,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {25#true} is VALID [2018-11-23 13:00:42,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:00:42,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {26#false} is VALID [2018-11-23 13:00:42,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume !true; {26#false} is VALID [2018-11-23 13:00:42,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {26#false} is VALID [2018-11-23 13:00:42,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume !(100 == #t~mem15);havoc #t~mem15; {26#false} is VALID [2018-11-23 13:00:42,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:00:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:42,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:42,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:43,002 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:00:43,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:43,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:43,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:43,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:43,175 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:00:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:43,315 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-23 13:00:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:43,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:00:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:00:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:00:43,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2018-11-23 13:00:43,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:43,616 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:00:43,616 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:00:43,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:00:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:00:43,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:43,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:00:43,654 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:00:43,654 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:00:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:43,658 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 13:00:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 13:00:43,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:43,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:43,659 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:00:43,659 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:00:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:43,663 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 13:00:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 13:00:43,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:43,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:43,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:43,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:00:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 13:00:43,668 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2018-11-23 13:00:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:43,669 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 13:00:43,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 13:00:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:00:43,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:43,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:43,670 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 433267234, now seen corresponding path program 1 times [2018-11-23 13:00:43,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:44,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-23 13:00:44,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {131#true} is VALID [2018-11-23 13:00:44,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-23 13:00:44,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #57#return; {131#true} is VALID [2018-11-23 13:00:44,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret16 := main(); {131#true} is VALID [2018-11-23 13:00:44,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:44,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:44,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:44,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {133#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {134#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-23 13:00:44,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {135#(= |main_#t~mem7| 0)} is VALID [2018-11-23 13:00:44,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {135#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {132#false} is VALID [2018-11-23 13:00:44,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {132#false} is VALID [2018-11-23 13:00:44,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {132#false} assume !(100 == #t~mem15);havoc #t~mem15; {132#false} is VALID [2018-11-23 13:00:44,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-23 13:00:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:44,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:44,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:00:44,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:00:44,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:44,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:00:44,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:44,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:00:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:00:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:44,229 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2018-11-23 13:00:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,837 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 13:00:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:44,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:00:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 13:00:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 13:00:44,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2018-11-23 13:00:44,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:44,923 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:00:44,924 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:00:44,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:00:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:00:44,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:44,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:00:44,941 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:00:44,941 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:00:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,945 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 13:00:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 13:00:44,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:44,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:44,947 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:00:44,947 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:00:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:44,950 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 13:00:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 13:00:44,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:44,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:44,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:44,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:00:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-23 13:00:44,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2018-11-23 13:00:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:44,954 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 13:00:44,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:00:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 13:00:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:00:44,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:44,956 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:44,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1224196553, now seen corresponding path program 1 times [2018-11-23 13:00:44,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:44,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:44,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:45,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2018-11-23 13:00:45,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {264#true} is VALID [2018-11-23 13:00:45,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2018-11-23 13:00:45,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #57#return; {264#true} is VALID [2018-11-23 13:00:45,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret16 := main(); {264#true} is VALID [2018-11-23 13:00:45,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {266#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-23 13:00:45,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {268#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-23 13:00:45,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {268#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {269#(= |main_#t~mem7| 0)} is VALID [2018-11-23 13:00:45,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {265#false} is VALID [2018-11-23 13:00:45,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {265#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {265#false} is VALID [2018-11-23 13:00:45,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {265#false} assume !(100 == #t~mem15);havoc #t~mem15; {265#false} is VALID [2018-11-23 13:00:45,254 INFO L273 TraceCheckUtils]: 16: Hoare triple {265#false} assume !false; {265#false} is VALID [2018-11-23 13:00:45,258 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 13:00:45,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:45,258 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 13:00:45,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:45,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:45,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:45,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 13:00:45,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 15 [2018-11-23 13:00:45,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:45,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:45,900 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 13:00:45,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:00:45,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:45,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 13:00:45,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 13:00:45,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:45,997 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 13:00:46,008 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,059 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,107 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 34 treesize of output 33 [2018-11-23 13:00:46,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:46,160 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 13:00:46,177 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,186 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:46,202 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2018-11-23 13:00:48,215 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:48,216 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, main_~head~0.offset, |v_#memory_int_21|, |v_#valid_12|]. (let ((.cse0 (store |v_#valid_12| main_~m~0.base 1)) (.cse1 (select |v_#memory_int_21| main_~list~0.base))) (and (= (select .cse0 main_~list~0.base) 0) (= (store |v_#memory_int_21| main_~list~0.base (let ((.cse2 (+ main_~head~0.offset 8))) (store .cse1 .cse2 (select (select |#memory_int| main_~list~0.base) .cse2)))) |#memory_int|) (= |#valid| (store .cse0 main_~list~0.base 1)) (= (let ((.cse3 (store |v_#memory_int_24| main_~m~0.base (store (select |v_#memory_int_24| main_~m~0.base) main_~m~0.offset 0)))) (store .cse3 main_~list~0.base (let ((.cse4 (+ main_~head~0.offset 4))) (store (store (select .cse3 main_~list~0.base) main_~head~0.offset 1) .cse4 (select .cse1 .cse4))))) |v_#memory_int_21|))) [2018-11-23 13:00:48,216 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~head~0.offset]. (and (= 1 (select |#valid| main_~list~0.base)) (= (select |#valid| main_~m~0.base) 1) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~list~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) [2018-11-23 13:00:48,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:48,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 13:00:48,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:48,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:48,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:48,945 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:48,947 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:00:48,952 INFO L168 Benchmark]: Toolchain (without parser) took 7873.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -519.6 MB). Peak memory consumption was 191.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:48,954 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 13:00:48,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:48,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:48,956 INFO L168 Benchmark]: Boogie Preprocessor took 43.22 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:48,957 INFO L168 Benchmark]: RCFGBuilder took 777.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:48,958 INFO L168 Benchmark]: TraceAbstraction took 6295.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 200.5 MB). Peak memory consumption was 200.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:48,963 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 637.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 116.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.22 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 777.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6295.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 200.5 MB). Peak memory consumption was 200.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...