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/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:33:15,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:33:15,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:33:15,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:33:15,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:33:15,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:33:15,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:33:15,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:33:15,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:33:15,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:33:15,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:33:15,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:33:15,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:33:15,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:33:15,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:33:15,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:33:15,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:33:15,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:33:15,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:33:15,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:33:15,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:33:15,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:33:15,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:33:15,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:33:15,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:33:15,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:33:15,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:33:15,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:33:15,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:33:15,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:33:15,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:33:15,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:33:15,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:33:15,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:33:15,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:33:15,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:33:15,050 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-14 17:33:15,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:33:15,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:33:15,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:33:15,074 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:33:15,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:33:15,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:33:15,075 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:33:15,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:33:15,075 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:33:15,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:33:15,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:33:15,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:33:15,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:33:15,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:33:15,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:33:15,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:33:15,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:33:15,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:33:15,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:33:15,081 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:33:15,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:33:15,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:33:15,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:33:15,151 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:33:15,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:33:15,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 17:33:15,214 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b006aafb/d0cc6458736e43499c3c7d2e1f93d697/FLAGf85ccbcb5 [2018-11-14 17:33:15,714 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:33:15,715 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 17:33:15,722 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b006aafb/d0cc6458736e43499c3c7d2e1f93d697/FLAGf85ccbcb5 [2018-11-14 17:33:15,736 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b006aafb/d0cc6458736e43499c3c7d2e1f93d697 [2018-11-14 17:33:15,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:33:15,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:33:15,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:15,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:33:15,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:33:15,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:15" (1/1) ... [2018-11-14 17:33:15,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4006a945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:15, skipping insertion in model container [2018-11-14 17:33:15,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:15" (1/1) ... [2018-11-14 17:33:15,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:33:15,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:33:15,994 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:16,000 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:33:16,032 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:16,057 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:33:16,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16 WrapperNode [2018-11-14 17:33:16,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:16,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:33:16,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:33:16,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:33:16,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (1/1) ... [2018-11-14 17:33:16,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:33:16,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:33:16,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:33:16,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:33:16,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (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-14 17:33:16,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:33:16,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:33:16,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:33:16,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:33:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:33:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:33:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:33:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:33:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:33:16,814 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:33:16,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:16 BoogieIcfgContainer [2018-11-14 17:33:16,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:33:16,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:33:16,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:33:16,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:33:16,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:33:15" (1/3) ... [2018-11-14 17:33:16,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc0f06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:16, skipping insertion in model container [2018-11-14 17:33:16,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:16" (2/3) ... [2018-11-14 17:33:16,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc0f06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:16, skipping insertion in model container [2018-11-14 17:33:16,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:16" (3/3) ... [2018-11-14 17:33:16,823 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 17:33:16,834 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:33:16,843 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:33:16,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:33:16,894 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:33:16,895 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:33:16,895 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:33:16,895 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:33:16,895 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:33:16,895 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:33:16,896 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:33:16,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:33:16,896 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:33:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 17:33:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:33:16,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:16,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:16,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1504457121, now seen corresponding path program 1 times [2018-11-14 17:33:16,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:16,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:16,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:17,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 17:33:17,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-14 17:33:17,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 17:33:17,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #58#return; {32#true} is VALID [2018-11-14 17:33:17,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret4 := main(); {32#true} is VALID [2018-11-14 17:33:17,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000);havoc ~index~0;~index~0 := 0; {32#true} is VALID [2018-11-14 17:33:17,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 17:33:17,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~index~0 := 0; {33#false} is VALID [2018-11-14 17:33:17,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 17:33:17,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~index~0 % 4294967296 < 1000); {33#false} is VALID [2018-11-14 17:33:17,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume (if ~index~0 % 4294967296 < 0 && ~index~0 % 4294967296 % 2 != 0 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296 == 0;call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {33#false} is VALID [2018-11-14 17:33:17,111 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem2 % 4294967296 == 0 then 1 else 0)); {33#false} is VALID [2018-11-14 17:33:17,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 17:33:17,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume ~cond == 0; {33#false} is VALID [2018-11-14 17:33:17,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 17:33:17,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-14 17:33:17,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:33:17,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:33:17,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:33:17,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:17,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:33:17,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:17,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:33:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:33:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:33:17,226 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 17:33:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:17,464 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-14 17:33:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:33:17,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:33:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:33:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:33:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:33:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:33:17,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-14 17:33:17,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:17,773 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:33:17,773 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:33:17,778 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-14 17:33:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:33:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:33:17,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:17,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:17,934 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:17,934 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:17,940 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 17:33:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:33:17,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:17,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:17,941 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:17,941 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:17,946 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 17:33:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:33:17,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:17,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:17,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:17,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:33:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 17:33:17,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-14 17:33:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:17,954 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 17:33:17,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:33:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:33:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:33:17,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:17,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:17,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:17,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -194164888, now seen corresponding path program 1 times [2018-11-14 17:33:17,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:18,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-14 17:33:18,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {179#true} is VALID [2018-11-14 17:33:18,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2018-11-14 17:33:18,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #58#return; {179#true} is VALID [2018-11-14 17:33:18,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret4 := main(); {179#true} is VALID [2018-11-14 17:33:18,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {179#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000);havoc ~index~0;~index~0 := 0; {181#(= main_~index~0 0)} is VALID [2018-11-14 17:33:18,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#(= main_~index~0 0)} assume true; {181#(= main_~index~0 0)} is VALID [2018-11-14 17:33:18,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 1000); {180#false} is VALID [2018-11-14 17:33:18,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {180#false} ~index~0 := 0; {180#false} is VALID [2018-11-14 17:33:18,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {180#false} assume true; {180#false} is VALID [2018-11-14 17:33:18,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {180#false} assume !!(~index~0 % 4294967296 < 1000); {180#false} is VALID [2018-11-14 17:33:18,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {180#false} assume (if ~index~0 % 4294967296 < 0 && ~index~0 % 4294967296 % 2 != 0 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296 == 0;call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {180#false} is VALID [2018-11-14 17:33:18,268 INFO L256 TraceCheckUtils]: 12: Hoare triple {180#false} call __VERIFIER_assert((if #t~mem2 % 4294967296 == 0 then 1 else 0)); {180#false} is VALID [2018-11-14 17:33:18,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {180#false} ~cond := #in~cond; {180#false} is VALID [2018-11-14 17:33:18,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {180#false} assume ~cond == 0; {180#false} is VALID [2018-11-14 17:33:18,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-14 17:33:18,270 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-14 17:33:18,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:33:18,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:33:18,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:33:18,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:18,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:33:18,360 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-14 17:33:18,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:33:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:33:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:33:18,361 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-14 17:33:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:22,566 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 17:33:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:33:22,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:33:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:33:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 17:33:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:33:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 17:33:22,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-14 17:33:22,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:22,850 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:33:22,850 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:33:22,851 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-14 17:33:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:33:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-14 17:33:22,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:22,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2018-11-14 17:33:22,904 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2018-11-14 17:33:22,904 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2018-11-14 17:33:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:22,908 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:33:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:33:22,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:22,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:22,910 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2018-11-14 17:33:22,910 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2018-11-14 17:33:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:22,914 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:33:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:33:22,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:22,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:22,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:22,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:33:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 17:33:22,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2018-11-14 17:33:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:22,920 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 17:33:22,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:33:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:33:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:33:22,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:22,921 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:22,921 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:22,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 706658557, now seen corresponding path program 1 times [2018-11-14 17:33:22,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:22,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:22,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:23,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-14 17:33:23,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-14 17:33:23,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-14 17:33:23,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #58#return; {354#true} is VALID [2018-11-14 17:33:23,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret4 := main(); {354#true} is VALID [2018-11-14 17:33:23,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000);havoc ~index~0;~index~0 := 0; {356#(= main_~index~0 0)} is VALID [2018-11-14 17:33:23,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {356#(= main_~index~0 0)} assume true; {356#(= main_~index~0 0)} is VALID [2018-11-14 17:33:23,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {356#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && ~index~0 % 4294967296 % 2 != 0 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {356#(= main_~index~0 0)} is VALID [2018-11-14 17:33:23,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {356#(= main_~index~0 0)} #t~post0 := ~index~0;~index~0 := #t~post0 + 1;havoc #t~post0; {357#(and (<= main_~index~0 1) (< 0 (+ (div main_~index~0 4294967296) 1)))} is INVALID [2018-11-14 17:33:23,340 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) 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-14 17:33:23,343 INFO L168 Benchmark]: Toolchain (without parser) took 7595.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -677.2 MB). Peak memory consumption was 59.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:23,345 INFO L168 Benchmark]: CDTParser took 0.22 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-14 17:33:23,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.33 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-14 17:33:23,347 INFO L168 Benchmark]: Boogie Preprocessor took 51.97 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-14 17:33:23,347 INFO L168 Benchmark]: RCFGBuilder took 704.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:23,349 INFO L168 Benchmark]: TraceAbstraction took 6526.26 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:23,353 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.22 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 305.33 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 51.97 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 704.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6526.26 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...