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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/n.c40_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:58:36,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:58:36,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:58:36,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:58:36,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:58:36,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:58:36,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:58:36,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:58:36,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:58:36,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:58:36,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:58:36,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:58:36,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:58:36,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:58:36,574 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:58:36,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:58:36,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:58:36,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:58:36,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:58:36,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:58:36,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:58:36,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:58:36,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:58:36,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:58:36,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:58:36,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:58:36,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:58:36,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:58:36,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:58:36,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:58:36,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:58:36,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:58:36,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:58:36,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:58:36,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:58:36,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:58:36,596 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-18 23:58:36,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:58:36,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:58:36,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:58:36,620 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:58:36,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:58:36,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:58:36,621 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:58:36,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:58:36,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:58:36,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:58:36,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:58:36,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:58:36,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:58:36,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:58:36,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:58:36,623 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:58:36,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:58:36,623 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:58:36,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:58:36,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:58:36,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:58:36,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:58:36,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:58:36,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:58:36,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:58:36,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:58:36,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:58:36,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:58:36,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:58:36,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:58:36,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:58:36,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:58:36,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:58:36,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:58:36,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:58:36,690 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:58:36,690 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40_true-unreach-call_true-termination.i [2018-11-18 23:58:36,748 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36fd303/625543f0e033443194281540f2d0155b/FLAG895330e49 [2018-11-18 23:58:37,230 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:58:37,231 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40_true-unreach-call_true-termination.i [2018-11-18 23:58:37,236 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36fd303/625543f0e033443194281540f2d0155b/FLAG895330e49 [2018-11-18 23:58:37,571 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36fd303/625543f0e033443194281540f2d0155b [2018-11-18 23:58:37,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:58:37,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:58:37,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:37,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:58:37,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:58:37,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3918343e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37, skipping insertion in model container [2018-11-18 23:58:37,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:58:37,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:58:37,847 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:37,859 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:58:37,885 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:37,918 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:58:37,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37 WrapperNode [2018-11-18 23:58:37,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:37,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:58:37,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:58:37,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:58:37,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (1/1) ... [2018-11-18 23:58:37,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:58:37,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:58:37,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:58:37,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:58:37,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (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-18 23:58:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:58:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:58:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:58:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:58:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:58:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:58:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:58:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:58:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:58:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:58:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:58:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:58:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:58:38,675 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:58:38,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:38 BoogieIcfgContainer [2018-11-18 23:58:38,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:58:38,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:58:38,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:58:38,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:58:38,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:37" (1/3) ... [2018-11-18 23:58:38,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437aecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:38, skipping insertion in model container [2018-11-18 23:58:38,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:37" (2/3) ... [2018-11-18 23:58:38,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437aecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:38, skipping insertion in model container [2018-11-18 23:58:38,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:38" (3/3) ... [2018-11-18 23:58:38,684 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c40_true-unreach-call_true-termination.i [2018-11-18 23:58:38,694 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:58:38,704 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:58:38,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:58:38,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:58:38,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:58:38,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:58:38,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:58:38,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:58:38,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:58:38,757 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:58:38,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:58:38,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:58:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 23:58:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 23:58:38,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:38,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:38,786 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:38,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -692123559, now seen corresponding path program 1 times [2018-11-18 23:58:38,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:38,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:38,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 23:58:38,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {22#true} is VALID [2018-11-18 23:58:38,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 23:58:38,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #39#return; {22#true} is VALID [2018-11-18 23:58:38,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2018-11-18 23:58:38,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {22#true} is VALID [2018-11-18 23:58:39,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-18 23:58:39,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {23#false} is VALID [2018-11-18 23:58:39,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {23#false} is VALID [2018-11-18 23:58:39,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == #t~mem4;havoc #t~mem4; {23#false} is VALID [2018-11-18 23:58:39,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 23:58:39,010 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-18 23:58:39,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:39,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:58:39,019 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 23:58:39,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:39,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:58:39,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:39,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:58:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:58:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:58:39,129 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 23:58:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:39,230 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 23:58:39,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:58:39,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 23:58:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-18 23:58:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-18 23:58:39,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-18 23:58:39,570 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-18 23:58:39,580 INFO L225 Difference]: With dead ends: 29 [2018-11-18 23:58:39,580 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 23:58:39,584 INFO L604 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-18 23:58:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 23:58:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 23:58:39,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:39,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:39,639 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:39,639 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:39,642 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:58:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:39,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:39,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:39,643 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:39,643 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:39,646 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:58:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:39,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:39,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:39,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:39,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:58:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 23:58:39,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 23:58:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:39,652 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 23:58:39,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:58:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 23:58:39,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:39,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:39,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:39,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 925435379, now seen corresponding path program 1 times [2018-11-18 23:58:39,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:39,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:39,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:39,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2018-11-18 23:58:39,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {107#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {107#true} is VALID [2018-11-18 23:58:39,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2018-11-18 23:58:39,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #39#return; {107#true} is VALID [2018-11-18 23:58:39,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret5 := main(); {107#true} is VALID [2018-11-18 23:58:39,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {107#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {109#(= ~i~0 0)} is VALID [2018-11-18 23:58:39,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {109#(= ~i~0 0)} assume true; {109#(= ~i~0 0)} is VALID [2018-11-18 23:58:39,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {109#(= ~i~0 0)} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {109#(= ~i~0 0)} is VALID [2018-11-18 23:58:39,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#(= ~i~0 0)} assume !(0 != #t~mem1);havoc #t~mem1; {109#(= ~i~0 0)} is VALID [2018-11-18 23:58:39,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#(= ~i~0 0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {109#(= ~i~0 0)} is VALID [2018-11-18 23:58:39,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#(= ~i~0 0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {108#false} is VALID [2018-11-18 23:58:39,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {108#false} assume 0 == #t~mem4;havoc #t~mem4; {108#false} is VALID [2018-11-18 23:58:39,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-11-18 23:58:39,832 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-18 23:58:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:58:39,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 23:58:39,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:39,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:58:39,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:39,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:58:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:58:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:58:39,887 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-18 23:58:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:39,992 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-18 23:58:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:58:39,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 23:58:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:58:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-18 23:58:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:58:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-18 23:58:39,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-18 23:58:40,144 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-18 23:58:40,145 INFO L225 Difference]: With dead ends: 22 [2018-11-18 23:58:40,145 INFO L226 Difference]: Without dead ends: 17 [2018-11-18 23:58:40,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:58:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-18 23:58:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 23:58:40,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:40,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-18 23:58:40,205 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-18 23:58:40,205 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-18 23:58:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:40,207 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 23:58:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:58:40,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:40,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:40,208 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-18 23:58:40,208 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-18 23:58:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:40,210 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 23:58:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:58:40,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:40,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:40,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:40,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:58:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 23:58:40,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-18 23:58:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:40,213 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-18 23:58:40,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:58:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:58:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:58:40,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:40,214 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:40,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:40,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2086497215, now seen corresponding path program 1 times [2018-11-18 23:58:40,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:40,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:40,620 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 9 [2018-11-18 23:58:40,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-18 23:58:40,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2018-11-18 23:58:40,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2018-11-18 23:58:40,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {197#true} #39#return; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2018-11-18 23:58:40,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~ret5 := main(); {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2018-11-18 23:58:40,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {200#(= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0)))} is VALID [2018-11-18 23:58:40,754 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0)))} assume true; {200#(= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0)))} is VALID [2018-11-18 23:58:40,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {200#(= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0)))} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {201#(and (= |main_#t~mem1| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} is VALID [2018-11-18 23:58:40,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {201#(and (= |main_#t~mem1| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} assume !!(0 != #t~mem1);havoc #t~mem1;call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {198#false} is VALID [2018-11-18 23:58:40,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-18 23:58:40,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {198#false} is VALID [2018-11-18 23:58:40,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} assume !(0 != #t~mem1);havoc #t~mem1; {198#false} is VALID [2018-11-18 23:58:40,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {198#false} is VALID [2018-11-18 23:58:40,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {198#false} is VALID [2018-11-18 23:58:40,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {198#false} assume 0 == #t~mem4;havoc #t~mem4; {198#false} is VALID [2018-11-18 23:58:40,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-18 23:58:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:58:40,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 23:58:40,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:40,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:58:40,991 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-18 23:58:40,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:58:40,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:58:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:58:40,993 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-18 23:58:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:41,244 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 23:58:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:58:41,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 23:58:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:58:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 23:58:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:58:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 23:58:41,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2018-11-18 23:58:41,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:41,284 INFO L225 Difference]: With dead ends: 17 [2018-11-18 23:58:41,284 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:58:41,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:58:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:58:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:58:41,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:41,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:41,286 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:41,286 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:41,286 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:41,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:41,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:41,287 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:41,287 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:41,287 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:41,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:41,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:41,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:41,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:58:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:58:41,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-11-18 23:58:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:41,289 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:58:41,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:58:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:41,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:41,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:58:41,381 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:58:41,381 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:58:41,381 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:41,382 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:41,382 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~i~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2018-11-18 23:58:41,382 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:58:41,382 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:58:41,382 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 23) no Hoare annotation was computed. [2018-11-18 23:58:41,382 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-11-18 23:58:41,383 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 23) no Hoare annotation was computed. [2018-11-18 23:58:41,383 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 8 23) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (and (= ~i~0 0) (= .cse0 (select |#memory_int| |~#x~0.base|))))) [2018-11-18 23:58:41,383 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-18 23:58:41,383 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2018-11-18 23:58:41,383 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2018-11-18 23:58:41,384 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2018-11-18 23:58:41,384 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2018-11-18 23:58:41,384 INFO L425 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2018-11-18 23:58:41,384 INFO L421 ceAbstractionStarter]: At program point L12-4(lines 12 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (and (= ~i~0 0) (= .cse0 (select |#memory_int| |~#x~0.base|))))) [2018-11-18 23:58:41,384 INFO L425 ceAbstractionStarter]: For program point L12-5(lines 12 15) no Hoare annotation was computed. [2018-11-18 23:58:41,386 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:58:41,391 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:58:41,391 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:41,392 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-18 23:58:41,393 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:58:41,394 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:58:41,394 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:58:41,398 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-18 23:58:41,401 INFO L168 Benchmark]: Toolchain (without parser) took 3820.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -667.3 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:41,403 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:58:41,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:41,404 INFO L168 Benchmark]: Boogie Preprocessor took 66.63 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-18 23:58:41,405 INFO L168 Benchmark]: RCFGBuilder took 689.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:41,406 INFO L168 Benchmark]: TraceAbstraction took 2723.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:41,411 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 336.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.63 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. * RCFGBuilder took 689.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2723.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...