java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-acceleration/array_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:29:44,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:29:44,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:29:44,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:29:44,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:29:44,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:29:44,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:29:44,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:29:44,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:29:44,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:29:44,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:29:44,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:29:44,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:29:44,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:29:44,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:29:44,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:29:44,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:29:44,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:29:44,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:29:44,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:29:44,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:29:44,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:29:44,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:29:44,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:29:44,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:29:44,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:29:44,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:29:44,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:29:44,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:29:44,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:29:44,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:29:44,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:29:44,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:29:44,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:29:44,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:29:44,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:29:44,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:29:44,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:29:44,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:29:44,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:29:44,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:29:44,632 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 [2019-10-07 13:29:44,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:29:44,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:29:44,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:29:44,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:29:44,668 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:29:44,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:29:44,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:29:44,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:29:44,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:29:44,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:29:44,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:29:44,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:29:44,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:29:44,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:29:44,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:29:44,673 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:29:44,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:29:44,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:29:44,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:29:44,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:29:44,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:29:44,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:29:44,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:29:44,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:29:44,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:29:44,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:29:44,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:29:44,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:29:44,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:29:44,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:29:44,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:29:44,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:29:44,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:29:44,990 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:29:44,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_4.i [2019-10-07 13:29:45,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3f71851/9d07ef1607c448428fdb46c6fbb692f0/FLAG637ba656e [2019-10-07 13:29:45,482 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:29:45,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2019-10-07 13:29:45,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3f71851/9d07ef1607c448428fdb46c6fbb692f0/FLAG637ba656e [2019-10-07 13:29:45,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3f71851/9d07ef1607c448428fdb46c6fbb692f0 [2019-10-07 13:29:45,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:29:45,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:29:45,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:45,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:29:45,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:29:45,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:45" (1/1) ... [2019-10-07 13:29:45,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2e1afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:45, skipping insertion in model container [2019-10-07 13:29:45,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:45" (1/1) ... [2019-10-07 13:29:45,931 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:29:45,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:29:46,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:46,173 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:29:46,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:46,212 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:29:46,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46 WrapperNode [2019-10-07 13:29:46,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:46,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:29:46,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:29:46,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:29:46,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (1/1) ... [2019-10-07 13:29:46,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:29:46,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:29:46,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:29:46,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:29:46,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (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 [2019-10-07 13:29:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:29:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:29:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:29:46,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:29:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:29:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:29:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:29:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:29:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:29:46,693 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:29:46,693 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:29:46,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:46 BoogieIcfgContainer [2019-10-07 13:29:46,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:29:46,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:29:46,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:29:46,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:29:46,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:29:45" (1/3) ... [2019-10-07 13:29:46,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fccf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:46, skipping insertion in model container [2019-10-07 13:29:46,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:46" (2/3) ... [2019-10-07 13:29:46,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fccf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:46, skipping insertion in model container [2019-10-07 13:29:46,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:46" (3/3) ... [2019-10-07 13:29:46,710 INFO L109 eAbstractionObserver]: Analyzing ICFG array_4.i [2019-10-07 13:29:46,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:29:46,740 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:29:46,758 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:29:46,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:29:46,787 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:29:46,787 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:29:46,787 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:29:46,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:29:46,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:29:46,788 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:29:46,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:29:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 13:29:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:29:46,808 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:46,809 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:46,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2005487052, now seen corresponding path program 1 times [2019-10-07 13:29:46,821 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:46,822 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:46,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:46,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:46,944 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:46,944 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:46,945 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:29:46,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:29:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:29:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:29:46,960 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-07 13:29:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:46,979 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 13:29:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:29:46,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-07 13:29:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:46,986 INFO L225 Difference]: With dead ends: 30 [2019-10-07 13:29:46,986 INFO L226 Difference]: Without dead ends: 13 [2019-10-07 13:29:46,989 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:29:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-07 13:29:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-07 13:29:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-07 13:29:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-07 13:29:47,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-07 13:29:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:47,022 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-07 13:29:47,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:29:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-07 13:29:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:29:47,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:47,023 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:47,023 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1973180885, now seen corresponding path program 1 times [2019-10-07 13:29:47,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:47,025 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:47,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,082 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:47,083 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:29:47,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:29:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:29:47,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:29:47,087 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-07 13:29:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:47,132 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-10-07 13:29:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:29:47,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:29:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:47,135 INFO L225 Difference]: With dead ends: 24 [2019-10-07 13:29:47,135 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 13:29:47,136 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:29:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 13:29:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-10-07 13:29:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-07 13:29:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-07 13:29:47,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-07 13:29:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:47,142 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-07 13:29:47,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:29:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-07 13:29:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:29:47,143 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:47,144 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:47,144 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1604112681, now seen corresponding path program 1 times [2019-10-07 13:29:47,145 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:47,145 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:29:47,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,236 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:47,237 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:29:47,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:29:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:29:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:29:47,238 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-07 13:29:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:47,298 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-07 13:29:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:29:47,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 13:29:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:47,301 INFO L225 Difference]: With dead ends: 21 [2019-10-07 13:29:47,301 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 13:29:47,301 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:29:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 13:29:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 13:29:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 13:29:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 13:29:47,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-07 13:29:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:47,309 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 13:29:47,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:29:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 13:29:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:29:47,310 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:47,310 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:47,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1243733017, now seen corresponding path program 1 times [2019-10-07 13:29:47,312 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:47,312 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:29:47,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:47,437 INFO L95 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 [2019-10-07 13:29:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:47,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:29:47,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:29:47,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:29:47,586 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:47,610 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:47,610 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:47,616 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:47,624 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:47,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:47,832 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:48,102 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:29:48,116 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:48,123 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:48,123 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:48,123 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:29:48,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:48,124 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:48,124 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:29:48,125 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:48,125 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:48,125 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:48,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:48,126 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:48,126 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:48,126 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:29:48,126 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:48,127 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~i~0_BEFORE_CALL_1) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) [2019-10-07 13:29:48,487 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:48,487 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 11] total 19 [2019-10-07 13:29:48,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 13:29:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 13:29:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:29:48,490 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2019-10-07 13:29:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:49,532 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-10-07 13:29:49,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 13:29:49,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-07 13:29:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:49,534 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:29:49,534 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 13:29:49,535 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 13:29:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 13:29:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 13:29:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:29:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 13:29:49,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-10-07 13:29:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:49,543 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 13:29:49,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 13:29:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 13:29:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:29:49,544 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:49,545 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:49,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:49,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:49,752 INFO L82 PathProgramCache]: Analyzing trace with hash 280735325, now seen corresponding path program 2 times [2019-10-07 13:29:49,752 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:49,752 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:49,753 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:49,753 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:29:49,860 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:49,860 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:49,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-10-07 13:29:49,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:29:49,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:49,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:29:49,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:29:49,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:29:49,989 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:49,990 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:49,990 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:49,991 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:49,991 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:49,991 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:50,027 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:50,144 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:29:50,155 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:50,161 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:50,162 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:50,162 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:29:50,162 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:50,163 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024))) (and (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:50,163 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:29:50,163 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:50,163 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:50,164 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:50,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:50,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:50,164 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024))) (and (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:50,165 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:29:50,165 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024))) (and (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:50,165 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024))) (and (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024)))) [2019-10-07 13:29:50,486 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:50,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 25 [2019-10-07 13:29:50,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 13:29:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 13:29:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-10-07 13:29:50,488 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2019-10-07 13:29:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:51,933 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-10-07 13:29:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-07 13:29:51,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-10-07 13:29:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:51,936 INFO L225 Difference]: With dead ends: 66 [2019-10-07 13:29:51,936 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:29:51,939 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=663, Invalid=2877, Unknown=0, NotChecked=0, Total=3540 [2019-10-07 13:29:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:29:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 13:29:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 13:29:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-10-07 13:29:51,947 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2019-10-07 13:29:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:51,948 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-10-07 13:29:51,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 13:29:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-10-07 13:29:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:29:51,949 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:51,949 INFO L385 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:52,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:52,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1071163863, now seen corresponding path program 3 times [2019-10-07 13:29:52,155 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:52,155 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:52,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:52,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 13:29:52,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:52,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:52,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2019-10-07 13:29:52,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:52,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:52,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:29:52,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 13:29:52,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 13:29:52,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:52,745 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:52,745 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:52,746 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:52,746 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:52,746 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:52,775 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:52,918 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:29:52,929 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:52,934 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:52,935 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:52,935 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:29:52,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:52,935 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:52,936 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:29:52,936 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:52,936 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:52,936 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:52,936 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:52,937 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:52,937 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:52,937 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:29:52,939 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:52,939 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* 4 v_main_~i~0_BEFORE_CALL_3)))) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) [2019-10-07 13:29:53,232 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:53,232 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13, 11] total 37 [2019-10-07 13:29:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-07 13:29:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-07 13:29:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2019-10-07 13:29:53,236 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 37 states. [2019-10-07 13:29:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:56,247 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2019-10-07 13:29:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-07 13:29:56,248 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 42 [2019-10-07 13:29:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:56,249 INFO L225 Difference]: With dead ends: 120 [2019-10-07 13:29:56,249 INFO L226 Difference]: Without dead ends: 79 [2019-10-07 13:29:56,255 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2861 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2202, Invalid=8100, Unknown=0, NotChecked=0, Total=10302 [2019-10-07 13:29:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-07 13:29:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-07 13:29:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-07 13:29:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-10-07 13:29:56,275 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 42 [2019-10-07 13:29:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:56,276 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-10-07 13:29:56,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-07 13:29:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-10-07 13:29:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 13:29:56,280 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:56,281 INFO L385 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:56,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:56,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2103025601, now seen corresponding path program 4 times [2019-10-07 13:29:56,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:56,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:56,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:56,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 13:29:57,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:57,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:57,036 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:57,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:29:57,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 13:29:57,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 13:29:57,936 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:57,937 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:57,938 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:57,938 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:57,938 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:57,938 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:57,986 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:58,085 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:29:58,093 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:58,097 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:58,098 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:58,098 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:29:58,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:58,099 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (<= v_main_~i~0_BEFORE_CALL_4 1024) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:58,099 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:29:58,099 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:58,099 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:58,100 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:58,100 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:58,100 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:58,101 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (<= v_main_~i~0_BEFORE_CALL_4 1024) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:58,101 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:29:58,101 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (<= v_main_~i~0_BEFORE_CALL_4 1024) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:58,101 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* 4 v_main_~i~0_BEFORE_CALL_4)))) (<= v_main_~i~0_BEFORE_CALL_4 1024) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) [2019-10-07 13:29:58,663 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:58,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25, 11] total 61 [2019-10-07 13:29:58,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-07 13:29:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-07 13:29:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=2451, Unknown=0, NotChecked=0, Total=3660 [2019-10-07 13:29:58,667 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2019-10-07 13:30:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:08,450 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2019-10-07 13:30:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-07 13:30:08,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2019-10-07 13:30:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:08,453 INFO L225 Difference]: With dead ends: 228 [2019-10-07 13:30:08,453 INFO L226 Difference]: Without dead ends: 151 [2019-10-07 13:30:08,463 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9772 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8195, Invalid=26214, Unknown=1, NotChecked=0, Total=34410 [2019-10-07 13:30:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-07 13:30:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-07 13:30:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-07 13:30:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-10-07 13:30:08,500 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 78 [2019-10-07 13:30:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:08,501 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-10-07 13:30:08,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-07 13:30:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-10-07 13:30:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 13:30:08,503 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:08,504 INFO L385 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:08,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:08,705 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2140019441, now seen corresponding path program 5 times [2019-10-07 13:30:08,706 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:08,706 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:08,706 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:08,707 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 13:30:09,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:09,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:09,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:30,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:30:30,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:30:30,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:30:30,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 13:30:30,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:30:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 13:30:33,298 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:30:33,300 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:30:33,300 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:30:33,300 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:30:33,301 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:30:33,301 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:30:33,321 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:30:33,411 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:30:33,419 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:30:33,422 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:30:33,422 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:30:33,422 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:30:33,423 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_5) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_5 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_5) (not (<= v_main_~i~0_BEFORE_CALL_5 1024)) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:33,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:30:33,423 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:30:33,423 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:30:33,424 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:30:33,424 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:30:33,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:30:33,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:30:33,425 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_5) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_5 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_5) (not (<= v_main_~i~0_BEFORE_CALL_5 1024)) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:33,425 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:30:33,426 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_5) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_5 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_5) (not (<= v_main_~i~0_BEFORE_CALL_5 1024)) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:33,426 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_BEFORE_CALL_5 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_5) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_5 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_5) (not (<= v_main_~i~0_BEFORE_CALL_5 1024)) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_5) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) [2019-10-07 13:30:33,922 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:30:33,922 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 49, 11] total 109 [2019-10-07 13:30:33,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-10-07 13:30:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-10-07 13:30:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4689, Invalid=7083, Unknown=0, NotChecked=0, Total=11772 [2019-10-07 13:30:33,929 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 109 states. [2019-10-07 13:30:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:55,920 INFO L93 Difference]: Finished difference Result 444 states and 541 transitions. [2019-10-07 13:30:55,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2019-10-07 13:30:55,920 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 150 [2019-10-07 13:30:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:55,924 INFO L225 Difference]: With dead ends: 444 [2019-10-07 13:30:55,924 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 13:30:55,935 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35693 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=31848, Invalid=93114, Unknown=0, NotChecked=0, Total=124962 [2019-10-07 13:30:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 13:30:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-07 13:30:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-07 13:30:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-10-07 13:30:55,959 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 150 [2019-10-07 13:30:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:55,959 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-10-07 13:30:55,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-10-07 13:30:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-10-07 13:30:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-07 13:30:55,965 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:55,965 INFO L385 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:56,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:56,177 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 710324561, now seen corresponding path program 6 times [2019-10-07 13:30:56,178 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:56,178 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:56,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:56,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-07 13:30:59,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:59,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:59,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:00,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:31:00,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:00,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 13:31:00,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 13:31:00,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 13:31:10,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:10,569 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:31:10,569 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:10,570 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:10,570 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:10,570 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:10,593 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:31:10,699 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:31:10,709 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:31:10,712 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:10,712 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:10,712 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:31:10,713 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_6 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_6 1024) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:10,713 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:31:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:31:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:31:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:31:10,714 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:31:10,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:31:10,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_6 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_6 1024) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:31:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_6 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_6 1024) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:10,715 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_6 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_6 1024) (<= 0 v_main_~i~0_BEFORE_CALL_6) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0)))) [2019-10-07 13:31:11,420 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:11,421 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 97, 97, 11] total 205 [2019-10-07 13:31:11,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 205 states [2019-10-07 13:31:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2019-10-07 13:31:11,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18561, Invalid=23259, Unknown=0, NotChecked=0, Total=41820 [2019-10-07 13:31:11,428 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 205 states. [2019-10-07 13:32:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:29,085 INFO L93 Difference]: Finished difference Result 876 states and 1069 transitions. [2019-10-07 13:32:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 490 states. [2019-10-07 13:32:29,085 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 294 [2019-10-07 13:32:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:29,090 INFO L225 Difference]: With dead ends: 876 [2019-10-07 13:32:29,091 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 13:32:29,100 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 968 SyntacticMatches, 0 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135917 ImplicationChecksByTransitivity, 79.0s TimeCoverageRelationStatistics Valid=125808, Invalid=349602, Unknown=0, NotChecked=0, Total=475410 [2019-10-07 13:32:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 13:32:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-07 13:32:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-07 13:32:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-10-07 13:32:29,131 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 294 [2019-10-07 13:32:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:29,132 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-10-07 13:32:29,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 205 states. [2019-10-07 13:32:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-10-07 13:32:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-10-07 13:32:29,145 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:32:29,145 INFO L385 BasicCegarLoop]: trace histogram [191, 190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:32:29,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:29,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:32:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:32:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1838785007, now seen corresponding path program 7 times [2019-10-07 13:32:29,352 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:32:29,352 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:29,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:29,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:32:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 13:32:43,252 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:43,252 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:32:43,252 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:43,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2143 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 13:32:43,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:32:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 36290 trivial. 0 not checked. [2019-10-07 13:32:44,021 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 36290 trivial. 0 not checked. [2019-10-07 13:33:23,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:23,542 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:33:23,542 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:23,542 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:23,543 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:23,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:23,574 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:23,634 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 13:33:23,639 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:23,641 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:23,642 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:23,642 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-07 13:33:23,642 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~i~0_BEFORE_CALL_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_7 1024))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:23,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)))) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:23,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:23,644 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~i~0_BEFORE_CALL_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_7 1024))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:23,644 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|)) |main_#t~mem3|)) [2019-10-07 13:33:23,644 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((v_main_~i~0_BEFORE_CALL_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_7 1024))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:23,644 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_main_~i~0_BEFORE_CALL_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_7 1024))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0)))) [2019-10-07 13:33:24,930 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:24,931 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [195, 193, 193, 11] total 397 [2019-10-07 13:33:24,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 397 states [2019-10-07 13:33:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 397 interpolants. [2019-10-07 13:33:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73953, Invalid=83259, Unknown=0, NotChecked=0, Total=157212 [2019-10-07 13:33:24,943 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 397 states. [2019-10-07 13:39:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:24,170 INFO L93 Difference]: Finished difference Result 1740 states and 2125 transitions. [2019-10-07 13:39:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 970 states. [2019-10-07 13:39:24,174 INFO L78 Accepts]: Start accepts. Automaton has 397 states. Word has length 582 [2019-10-07 13:39:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:24,184 INFO L225 Difference]: With dead ends: 1740 [2019-10-07 13:39:24,184 INFO L226 Difference]: Without dead ends: 1159 [2019-10-07 13:39:24,216 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3288 GetRequests, 1928 SyntacticMatches, 0 SemanticMatches, 1360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529901 ImplicationChecksByTransitivity, 300.2s TimeCoverageRelationStatistics Valid=500352, Invalid=1353330, Unknown=0, NotChecked=0, Total=1853682 [2019-10-07 13:39:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-10-07 13:39:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2019-10-07 13:39:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-10-07 13:39:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1160 transitions. [2019-10-07 13:39:24,270 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1160 transitions. Word has length 582 [2019-10-07 13:39:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:24,270 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 1160 transitions. [2019-10-07 13:39:24,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 397 states. [2019-10-07 13:39:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1160 transitions. [2019-10-07 13:39:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2019-10-07 13:39:24,323 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:24,324 INFO L385 BasicCegarLoop]: trace histogram [383, 382, 382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:24,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:24,530 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1954527121, now seen corresponding path program 8 times [2019-10-07 13:39:24,531 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:24,532 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:24,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:24,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 219459 backedges. 0 proven. 146306 refuted. 0 times theorem prover too weak. 73153 trivial. 0 not checked. [2019-10-07 13:40:19,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:19,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:40:19,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true