/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:06,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:06,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:06,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:06,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:06,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:06,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:06,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:06,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:06,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:06,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:06,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:06,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:06,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:06,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:06,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:06,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:06,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:06,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:06,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:06,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:06,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:06,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:06,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:06,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:06,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:06,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:06,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:06,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:06,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:06,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:06,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:06,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:06,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:06,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:06,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:06,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:06,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:06,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:06,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:06,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:06,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:06,566 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:06,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:06,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:06,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:06,568 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:06,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:06,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:06,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:06,570 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:06,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:06,570 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:06,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:06,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:06,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:06,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:06,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:06,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:06,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:06,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:06,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:06,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:06,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:06,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:06,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:06,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:06,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:06,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:06,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:06,911 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:06,913 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:06,914 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-2.c [2020-07-10 15:28:06,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeaf2cc3d/79bf948eb3314def9487b74da7aacb26/FLAG7caa35a44 [2020-07-10 15:28:07,462 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:07,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c [2020-07-10 15:28:07,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeaf2cc3d/79bf948eb3314def9487b74da7aacb26/FLAG7caa35a44 [2020-07-10 15:28:07,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeaf2cc3d/79bf948eb3314def9487b74da7aacb26 [2020-07-10 15:28:07,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:07,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:07,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:07,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:07,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:07,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:07" (1/1) ... [2020-07-10 15:28:07,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786be218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:07, skipping insertion in model container [2020-07-10 15:28:07,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:07" (1/1) ... [2020-07-10 15:28:07,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:07,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:08,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:08,019 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:08,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:08,059 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:08,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08 WrapperNode [2020-07-10 15:28:08,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:08,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:08,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:08,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:08,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (1/1) ... [2020-07-10 15:28:08,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:08,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:08,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:08,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:08,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (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 [2020-07-10 15:28:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:28:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:28:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:28:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:28:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:08,473 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:08,473 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:28:08,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:08 BoogieIcfgContainer [2020-07-10 15:28:08,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:08,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:08,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:08,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:08,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:07" (1/3) ... [2020-07-10 15:28:08,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b493491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:08, skipping insertion in model container [2020-07-10 15:28:08,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:08" (2/3) ... [2020-07-10 15:28:08,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b493491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:08, skipping insertion in model container [2020-07-10 15:28:08,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:08" (3/3) ... [2020-07-10 15:28:08,486 INFO L109 eAbstractionObserver]: Analyzing ICFG array_1-2.c [2020-07-10 15:28:08,515 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:08,534 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:08,565 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:08,597 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:08,597 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:08,597 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:08,597 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:08,597 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:08,597 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:08,598 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:08,598 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 15:28:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:28:08,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:08,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:08,618 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2020-07-10 15:28:08,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:08,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954500579] [2020-07-10 15:28:08,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:08,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#true} is VALID [2020-07-10 15:28:08,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:28:08,821 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2020-07-10 15:28:08,825 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:08,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#true} is VALID [2020-07-10 15:28:08,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:28:08,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2020-07-10 15:28:08,826 INFO L263 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2020-07-10 15:28:08,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24#true} is VALID [2020-07-10 15:28:08,828 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-10 15:28:08,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2020-07-10 15:28:08,829 INFO L263 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {25#false} is VALID [2020-07-10 15:28:08,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-10 15:28:08,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-10 15:28:08,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 15:28:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:08,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954500579] [2020-07-10 15:28:08,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:28:08,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79027955] [2020-07-10 15:28:08,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 15:28:08,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:08,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:28:08,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:08,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:28:08,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:28:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:28:08,886 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-07-10 15:28:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,004 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-10 15:28:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:28:09,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 15:28:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2020-07-10 15:28:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:28:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2020-07-10 15:28:09,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2020-07-10 15:28:09,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,096 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:28:09,096 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:28:09,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:28:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:28:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:28:09,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:09,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:28:09,144 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:28:09,144 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:28:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,147 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:28:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:28:09,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,149 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:28:09,149 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:28:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,152 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:28:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:28:09,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:09,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:28:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:28:09,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:28:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:09,157 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:28:09,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:28:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:28:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:28:09,158 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:09,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:09,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:09,159 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2020-07-10 15:28:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:09,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83967162] [2020-07-10 15:28:09,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {124#true} is VALID [2020-07-10 15:28:09,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {124#true} assume true; {124#true} is VALID [2020-07-10 15:28:09,240 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} #35#return; {124#true} is VALID [2020-07-10 15:28:09,242 INFO L263 TraceCheckUtils]: 0: Hoare triple {124#true} call ULTIMATE.init(); {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:09,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {124#true} is VALID [2020-07-10 15:28:09,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {124#true} assume true; {124#true} is VALID [2020-07-10 15:28:09,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} #35#return; {124#true} is VALID [2020-07-10 15:28:09,243 INFO L263 TraceCheckUtils]: 4: Hoare triple {124#true} call #t~ret2 := main(); {124#true} is VALID [2020-07-10 15:28:09,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {124#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {129#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:09,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {129#(= 0 main_~i~0)} assume !(~i~0 < 1024); {125#false} is VALID [2020-07-10 15:28:09,246 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {125#false} is VALID [2020-07-10 15:28:09,246 INFO L263 TraceCheckUtils]: 8: Hoare triple {125#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {125#false} is VALID [2020-07-10 15:28:09,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {125#false} ~cond := #in~cond; {125#false} is VALID [2020-07-10 15:28:09,247 INFO L280 TraceCheckUtils]: 10: Hoare triple {125#false} assume 0 == ~cond; {125#false} is VALID [2020-07-10 15:28:09,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {125#false} assume !false; {125#false} is VALID [2020-07-10 15:28:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:09,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83967162] [2020-07-10 15:28:09,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:09,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:09,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349498955] [2020-07-10 15:28:09,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:28:09,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:09,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:09,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:09,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:09,273 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2020-07-10 15:28:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,358 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-10 15:28:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:28:09,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:28:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-10 15:28:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-10 15:28:09,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2020-07-10 15:28:09,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,409 INFO L225 Difference]: With dead ends: 22 [2020-07-10 15:28:09,409 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:28:09,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:28:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-10 15:28:09,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:09,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-10 15:28:09,431 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-10 15:28:09,431 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-10 15:28:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,433 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:28:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:28:09,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,434 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-10 15:28:09,434 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-10 15:28:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,436 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:28:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:28:09,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:09,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:28:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:28:09,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2020-07-10 15:28:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:09,439 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:28:09,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:28:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:28:09,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:09,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:09,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:09,441 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2020-07-10 15:28:09,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:09,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951046127] [2020-07-10 15:28:09,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {220#true} is VALID [2020-07-10 15:28:09,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2020-07-10 15:28:09,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #35#return; {220#true} is VALID [2020-07-10 15:28:09,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {227#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:09,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {220#true} is VALID [2020-07-10 15:28:09,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2020-07-10 15:28:09,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #35#return; {220#true} is VALID [2020-07-10 15:28:09,517 INFO L263 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret2 := main(); {220#true} is VALID [2020-07-10 15:28:09,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {225#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:09,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#(= 0 main_~i~0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {225#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:09,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {226#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:09,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 1)} assume !(~i~0 < 1024); {221#false} is VALID [2020-07-10 15:28:09,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {221#false} is VALID [2020-07-10 15:28:09,521 INFO L263 TraceCheckUtils]: 10: Hoare triple {221#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {221#false} is VALID [2020-07-10 15:28:09,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2020-07-10 15:28:09,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2020-07-10 15:28:09,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-10 15:28:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:09,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951046127] [2020-07-10 15:28:09,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830970917] [2020-07-10 15:28:09,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:28:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:09,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:09,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2020-07-10 15:28:09,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {220#true} is VALID [2020-07-10 15:28:09,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2020-07-10 15:28:09,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #35#return; {220#true} is VALID [2020-07-10 15:28:09,650 INFO L263 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret2 := main(); {220#true} is VALID [2020-07-10 15:28:09,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {246#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:09,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {246#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {246#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:09,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {246#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {226#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:09,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 1)} assume !(~i~0 < 1024); {221#false} is VALID [2020-07-10 15:28:09,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {221#false} is VALID [2020-07-10 15:28:09,654 INFO L263 TraceCheckUtils]: 10: Hoare triple {221#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {221#false} is VALID [2020-07-10 15:28:09,654 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2020-07-10 15:28:09,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2020-07-10 15:28:09,655 INFO L280 TraceCheckUtils]: 13: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-10 15:28:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:09,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:09,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:28:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758643663] [2020-07-10 15:28:09,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:28:09,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:09,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:09,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:09,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:09,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:09,684 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2020-07-10 15:28:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,792 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-10 15:28:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:09,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:28:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-10 15:28:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-10 15:28:09,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2020-07-10 15:28:09,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:09,828 INFO L225 Difference]: With dead ends: 24 [2020-07-10 15:28:09,829 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:28:09,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:28:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-10 15:28:09,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:09,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-10 15:28:09,841 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-10 15:28:09,842 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-10 15:28:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,843 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:28:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:28:09,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,844 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-10 15:28:09,844 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-10 15:28:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:09,846 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:28:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:28:09,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:09,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:09,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:09,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:28:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-10 15:28:09,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2020-07-10 15:28:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:09,849 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-10 15:28:09,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 15:28:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:09,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:09,850 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:10,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:28:10,063 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2020-07-10 15:28:10,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:10,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055011881] [2020-07-10 15:28:10,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,157 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-10 15:28:10,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:28:10,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #35#return; {367#true} is VALID [2020-07-10 15:28:10,165 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:10,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-10 15:28:10,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:28:10,166 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #35#return; {367#true} is VALID [2020-07-10 15:28:10,167 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret2 := main(); {367#true} is VALID [2020-07-10 15:28:10,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {372#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:10,170 INFO L280 TraceCheckUtils]: 6: Hoare triple {372#(= 0 main_~i~0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {372#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:10,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {373#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {373#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,173 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {374#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:10,174 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#(<= main_~i~0 2)} assume !(~i~0 < 1024); {368#false} is VALID [2020-07-10 15:28:10,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {368#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {368#false} is VALID [2020-07-10 15:28:10,175 INFO L263 TraceCheckUtils]: 12: Hoare triple {368#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {368#false} is VALID [2020-07-10 15:28:10,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} ~cond := #in~cond; {368#false} is VALID [2020-07-10 15:28:10,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {368#false} assume 0 == ~cond; {368#false} is VALID [2020-07-10 15:28:10,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-10 15:28:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:10,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055011881] [2020-07-10 15:28:10,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316455247] [2020-07-10 15:28:10,179 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:10,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:28:10,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:10,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:28:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:10,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {367#true} is VALID [2020-07-10 15:28:10,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-10 15:28:10,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:28:10,310 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #35#return; {367#true} is VALID [2020-07-10 15:28:10,310 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret2 := main(); {367#true} is VALID [2020-07-10 15:28:10,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {394#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:10,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {394#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {394#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:10,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {394#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {373#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {373#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {374#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:10,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#(<= main_~i~0 2)} assume !(~i~0 < 1024); {368#false} is VALID [2020-07-10 15:28:10,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {368#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {368#false} is VALID [2020-07-10 15:28:10,316 INFO L263 TraceCheckUtils]: 12: Hoare triple {368#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {368#false} is VALID [2020-07-10 15:28:10,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} ~cond := #in~cond; {368#false} is VALID [2020-07-10 15:28:10,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {368#false} assume 0 == ~cond; {368#false} is VALID [2020-07-10 15:28:10,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-10 15:28:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:10,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:10,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:28:10,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610215322] [2020-07-10 15:28:10,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 15:28:10,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:10,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:10,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:10,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:10,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:10,351 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2020-07-10 15:28:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,500 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:28:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:10,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 15:28:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 15:28:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-10 15:28:10,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-10 15:28:10,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:10,553 INFO L225 Difference]: With dead ends: 26 [2020-07-10 15:28:10,553 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:28:10,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:28:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-10 15:28:10,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:10,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2020-07-10 15:28:10,578 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2020-07-10 15:28:10,579 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2020-07-10 15:28:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,590 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:28:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:28:10,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:10,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:10,591 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2020-07-10 15:28:10,591 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2020-07-10 15:28:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:10,593 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:28:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:28:10,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:10,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:10,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:10,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:28:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-10 15:28:10,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2020-07-10 15:28:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:10,596 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-10 15:28:10,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-10 15:28:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:28:10,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:10,597 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:10,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:10,797 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2020-07-10 15:28:10,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:10,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884238980] [2020-07-10 15:28:10,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {531#true} is VALID [2020-07-10 15:28:10,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {531#true} assume true; {531#true} is VALID [2020-07-10 15:28:10,929 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {531#true} {531#true} #35#return; {531#true} is VALID [2020-07-10 15:28:10,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:28:10,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {531#true} is VALID [2020-07-10 15:28:10,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2020-07-10 15:28:10,931 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #35#return; {531#true} is VALID [2020-07-10 15:28:10,932 INFO L263 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret2 := main(); {531#true} is VALID [2020-07-10 15:28:10,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {536#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:10,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {536#(= 0 main_~i~0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {536#(= 0 main_~i~0)} is VALID [2020-07-10 15:28:10,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {536#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {537#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {537#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {537#(<= main_~i~0 1)} is VALID [2020-07-10 15:28:10,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {538#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:10,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {538#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {538#(<= main_~i~0 2)} is VALID [2020-07-10 15:28:10,941 INFO L280 TraceCheckUtils]: 11: Hoare triple {538#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {539#(<= main_~i~0 3)} is VALID [2020-07-10 15:28:10,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= main_~i~0 3)} assume !(~i~0 < 1024); {532#false} is VALID [2020-07-10 15:28:10,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {532#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {532#false} is VALID [2020-07-10 15:28:10,942 INFO L263 TraceCheckUtils]: 14: Hoare triple {532#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {532#false} is VALID [2020-07-10 15:28:10,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {532#false} ~cond := #in~cond; {532#false} is VALID [2020-07-10 15:28:10,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {532#false} assume 0 == ~cond; {532#false} is VALID [2020-07-10 15:28:10,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {532#false} assume !false; {532#false} is VALID [2020-07-10 15:28:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:10,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884238980] [2020-07-10 15:28:10,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390124049] [2020-07-10 15:28:10,944 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:10,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:28:10,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:10,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:28:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:10,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:11,042 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-10 15:28:11,043 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:11,053 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:28:11,054 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:28:11,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-10 15:28:11,207 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:28:11,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2020-07-10 15:28:11,209 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:28:11,223 INFO L624 ElimStorePlain]: treesize reduction 11, result has 47.6 percent of original size [2020-07-10 15:28:11,227 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:28:11,228 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2020-07-10 15:28:11,231 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:28:11,231 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#A~0.base|, v_main_~i~0_10, |main_~#A~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#A~0.base|))) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select .cse0 (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))) (= (select .cse0 (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (<= 1023 v_main_~i~0_10))) [2020-07-10 15:28:11,231 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< |main_#t~mem1| 1024) (<= 1023 |main_#t~mem1|)) [2020-07-10 15:28:11,261 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:28:11,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {531#true} is VALID [2020-07-10 15:28:11,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {531#true} is VALID [2020-07-10 15:28:11,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2020-07-10 15:28:11,311 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #35#return; {531#true} is VALID [2020-07-10 15:28:11,311 INFO L263 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret2 := main(); {531#true} is VALID [2020-07-10 15:28:11,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {531#true} is VALID [2020-07-10 15:28:11,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {531#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {531#true} is VALID [2020-07-10 15:28:11,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {531#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {531#true} is VALID [2020-07-10 15:28:11,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {531#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {531#true} is VALID [2020-07-10 15:28:11,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {531#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {531#true} is VALID [2020-07-10 15:28:11,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {531#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {574#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|))))} is VALID [2020-07-10 15:28:11,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {574#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {578#(exists ((v_main_~i~0_10 Int)) (and (<= main_~i~0 (+ v_main_~i~0_10 1)) (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|)))))} is VALID [2020-07-10 15:28:11,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {578#(exists ((v_main_~i~0_10 Int)) (and (<= main_~i~0 (+ v_main_~i~0_10 1)) (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|)))))} assume !(~i~0 < 1024); {582#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} is VALID [2020-07-10 15:28:11,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {582#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {586#(and (< |main_#t~mem1| 1024) (<= 1023 |main_#t~mem1|))} is VALID [2020-07-10 15:28:11,319 INFO L263 TraceCheckUtils]: 14: Hoare triple {586#(and (< |main_#t~mem1| 1024) (<= 1023 |main_#t~mem1|))} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {590#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:11,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {590#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {594#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:11,321 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {532#false} is VALID [2020-07-10 15:28:11,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {532#false} assume !false; {532#false} is VALID [2020-07-10 15:28:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:28:11,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:11,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2020-07-10 15:28:11,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80629492] [2020-07-10 15:28:11,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:28:11,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:11,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:11,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:11,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:11,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:11,346 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 8 states. [2020-07-10 15:28:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,637 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:28:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:15,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:28:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2020-07-10 15:28:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2020-07-10 15:28:15,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2020-07-10 15:28:15,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:15,672 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:28:15,672 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:15,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:28:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:15,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:15,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,674 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,674 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,675 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,675 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:15,676 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:15,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:15,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:15,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 15:28:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:15,677 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:15,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:15,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:15,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:15,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:15,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:15,975 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:28:15,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:15,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:15,976 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:15,976 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:15,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:15,976 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 19) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:28:15,976 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 10 19) no Hoare annotation was computed. [2020-07-10 15:28:15,977 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10))) (exists ((v_main_~i~0_10 Int)) (and (<= main_~i~0 (+ v_main_~i~0_10 1)) (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))))) (< |main_#t~mem1| 1024) (<= 1023 |main_#t~mem1|)) [2020-07-10 15:28:15,977 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-10 15:28:15,977 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 10 19) no Hoare annotation was computed. [2020-07-10 15:28:15,977 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2020-07-10 15:28:15,977 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 16) the Hoare annotation is: (or (exists ((v_main_~i~0_10 Int)) (and (<= main_~i~0 (+ v_main_~i~0_10 1)) (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_10 4) |main_~#A~0.offset|))))) (= 0 main_~i~0)) [2020-07-10 15:28:15,977 INFO L268 CegarLoopResult]: For program point L14-4(lines 14 16) no Hoare annotation was computed. [2020-07-10 15:28:15,977 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:28:15,978 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:15,978 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:28:15,978 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:15,978 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:28:15,978 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:28:15,982 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:15,984 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:15,984 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:15,985 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:15,985 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-10 15:28:15,985 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-10 15:28:15,985 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:15,986 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:15,987 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:15,987 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:15,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:28:15,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:15,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:28:16,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:16 BoogieIcfgContainer [2020-07-10 15:28:16,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:16,003 INFO L168 Benchmark]: Toolchain (without parser) took 8183.98 ms. Allocated memory was 139.5 MB in the beginning and 246.9 MB in the end (delta: 107.5 MB). Free memory was 104.4 MB in the beginning and 211.7 MB in the end (delta: -107.4 MB). Peak memory consumption was 93.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,005 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.77 ms. Allocated memory is still 139.5 MB. Free memory was 104.1 MB in the beginning and 93.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,006 INFO L168 Benchmark]: Boogie Preprocessor took 112.37 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.7 MB in the beginning and 181.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,007 INFO L168 Benchmark]: RCFGBuilder took 303.76 ms. Allocated memory is still 203.9 MB. Free memory was 181.9 MB in the beginning and 165.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:16,008 INFO L168 Benchmark]: TraceAbstraction took 7523.32 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 165.0 MB in the beginning and 211.7 MB in the end (delta: -46.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:28:16,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.77 ms. Allocated memory is still 139.5 MB. Free memory was 104.1 MB in the beginning and 93.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.37 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.7 MB in the beginning and 181.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 303.76 ms. Allocated memory is still 203.9 MB. Free memory was 181.9 MB in the beginning and 165.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7523.32 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 165.0 MB in the beginning and 211.7 MB in the end (delta: -46.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 14]: Loop Invariant [2020-07-10 15:28:16,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,020 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:28:16,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2020-07-10 15:28:16,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists v_main_~i~0_10 : int :: (i <= v_main_~i~0_10 + 1 && v_main_~i~0_10 < 1024) && v_main_~i~0_10 == unknown-#memory_int-unknown[A][v_main_~i~0_10 * 4 + A]) || 0 == i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.2s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 24 SDslu, 79 SDs, 0 SdLazy, 115 SolverSat, 11 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 88 HoareAnnotationTreeSize, 11 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 2 QuantifiedInterpolants, 3981 SizeOfPredicates, 8 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 9/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...