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_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:29:26,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:29:26,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:29:27,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:29:27,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:29:27,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:29:27,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:29:27,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:29:27,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:29:27,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:29:27,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:29:27,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:29:27,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:29:27,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:29:27,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:29:27,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:29:27,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:29:27,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:29:27,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:29:27,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:29:27,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:29:27,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:29:27,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:29:27,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:29:27,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:29:27,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:29:27,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:29:27,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:29:27,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:29:27,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:29:27,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:29:27,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:29:27,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:29:27,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:29:27,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:29:27,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:29:27,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:29:27,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:29:27,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:29:27,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:29:27,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:29:27,083 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:27,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:29:27,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:29:27,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:29:27,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:29:27,121 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:29:27,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:29:27,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:29:27,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:29:27,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:29:27,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:29:27,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:29:27,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:29:27,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:29:27,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:29:27,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:29:27,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:29:27,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:29:27,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:29:27,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:29:27,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:29:27,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:29:27,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:29:27,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:29:27,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:29:27,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:29:27,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:29:27,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:29:27,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:29:27,128 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:27,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:29:27,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:29:27,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:29:27,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:29:27,420 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:29:27,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-10-07 13:29:27,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78b53d66/1f18c1f238644faf9705f7ddcfb46a42/FLAG087751c97 [2019-10-07 13:29:27,980 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:29:27,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-10-07 13:29:27,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78b53d66/1f18c1f238644faf9705f7ddcfb46a42/FLAG087751c97 [2019-10-07 13:29:28,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78b53d66/1f18c1f238644faf9705f7ddcfb46a42 [2019-10-07 13:29:28,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:29:28,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:29:28,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:28,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:29:28,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:29:28,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:28" (1/1) ... [2019-10-07 13:29:28,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:28, skipping insertion in model container [2019-10-07 13:29:28,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:28" (1/1) ... [2019-10-07 13:29:28,409 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:29:28,426 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:29:28,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:28,693 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:29:28,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:28,748 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:29:28,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:28 WrapperNode [2019-10-07 13:29:28,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:28,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:29:28,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:29:28,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:29:28,885 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:28" (1/1) ... [2019-10-07 13:29:28,885 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:28" (1/1) ... [2019-10-07 13:29:28,895 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:28" (1/1) ... [2019-10-07 13:29:28,897 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:28" (1/1) ... [2019-10-07 13:29:28,910 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:28" (1/1) ... [2019-10-07 13:29:28,916 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:28" (1/1) ... [2019-10-07 13:29:28,923 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:28" (1/1) ... [2019-10-07 13:29:28,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:29:28,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:29:28,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:29:28,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:29:28,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:28" (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:28,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:29:28,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:29:28,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:29:28,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:29:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:29:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:29:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:29:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:29:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:29:29,331 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:29:29,331 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:29:29,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:29 BoogieIcfgContainer [2019-10-07 13:29:29,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:29:29,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:29:29,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:29:29,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:29:29,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:29:28" (1/3) ... [2019-10-07 13:29:29,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb1f779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:29, skipping insertion in model container [2019-10-07 13:29:29,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:28" (2/3) ... [2019-10-07 13:29:29,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb1f779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:29, skipping insertion in model container [2019-10-07 13:29:29,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:29" (3/3) ... [2019-10-07 13:29:29,347 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2019-10-07 13:29:29,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:29:29,361 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:29:29,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:29:29,399 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:29:29,399 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:29:29,399 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:29:29,399 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:29:29,400 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:29:29,400 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:29:29,400 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:29:29,400 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:29:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 13:29:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:29:29,425 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:29,426 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:29,428 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1037966573, now seen corresponding path program 1 times [2019-10-07 13:29:29,444 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:29,445 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,445 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,445 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:29,588 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:29,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,589 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:29,589 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:29:29,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:29:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:29:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:29:29,606 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-07 13:29:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:29,626 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 13:29:29,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:29:29,627 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-07 13:29:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:29,634 INFO L225 Difference]: With dead ends: 30 [2019-10-07 13:29:29,635 INFO L226 Difference]: Without dead ends: 13 [2019-10-07 13:29:29,638 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:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-07 13:29:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-07 13:29:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-07 13:29:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-07 13:29:29,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-07 13:29:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:29,678 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-07 13:29:29,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:29:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-07 13:29:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:29:29,679 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:29,680 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:29,680 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1362773192, now seen corresponding path program 1 times [2019-10-07 13:29:29,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:29,681 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,681 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:29,747 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:29,747 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,748 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:29,748 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:29:29,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:29:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:29:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:29:29,751 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-07 13:29:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:29,792 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-10-07 13:29:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:29:29,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:29:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:29,795 INFO L225 Difference]: With dead ends: 24 [2019-10-07 13:29:29,796 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 13:29:29,797 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:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 13:29:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-10-07 13:29:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-07 13:29:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-07 13:29:29,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-07 13:29:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:29,803 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-07 13:29:29,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:29:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-07 13:29:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:29:29,804 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:29,805 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:29,805 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash 723631731, now seen corresponding path program 1 times [2019-10-07 13:29:29,806 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:29,806 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:29,904 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:29,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,906 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:29,906 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:29:29,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:29:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:29:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:29:29,907 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-07 13:29:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:29,968 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-07 13:29:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:29:29,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 13:29:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:29,970 INFO L225 Difference]: With dead ends: 21 [2019-10-07 13:29:29,970 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 13:29:29,971 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:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 13:29:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 13:29:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 13:29:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 13:29:29,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-07 13:29:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:29,977 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 13:29:29,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:29:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 13:29:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:29:29,978 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:29,978 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:29,979 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash 671297680, now seen corresponding path program 1 times [2019-10-07 13:29:29,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:29,980 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:29,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:30,065 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:30,066 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:30,066 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:30,066 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:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:30,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:29:30,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:30,176 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:30,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:30,222 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:30,223 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:30,287 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:30,288 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:30,295 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:30,306 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:30,307 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:30,547 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:30,855 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:29:30,885 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:30,894 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:30,894 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:30,894 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:29:30,895 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:30,896 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 512) (<= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (not (<= v_main_~i~0_BEFORE_CALL_1 512)) (= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:30,899 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 512) (<= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (not (<= v_main_~i~0_BEFORE_CALL_1 512)) (= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:30,900 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 512) (<= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (not (<= v_main_~i~0_BEFORE_CALL_1 512)) (= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:30,901 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:30,901 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:30,901 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:30,902 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:30,902 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:29:30,902 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 512) (<= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (not (<= v_main_~i~0_BEFORE_CALL_1 512)) (= 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|))) (< v_main_~i~0_BEFORE_CALL_1 1024)))) [2019-10-07 13:29:30,902 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:29:30,903 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:31,205 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:31,205 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 10] total 18 [2019-10-07 13:29:31,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 13:29:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 13:29:31,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:29:31,208 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 18 states. [2019-10-07 13:29:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:32,082 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-10-07 13:29:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 13:29:32,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-10-07 13:29:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:32,084 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:29:32,084 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:29:32,086 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 13:29:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:29:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-10-07 13:29:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:29:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-07 13:29:32,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2019-10-07 13:29:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:32,093 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-07 13:29:32,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 13:29:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-07 13:29:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:29:32,094 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:32,094 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:32,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:32,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 911849586, now seen corresponding path program 2 times [2019-10-07 13:29:32,299 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:32,299 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:32,299 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:32,300 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:29:32,386 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:32,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:32,387 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:32,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:29:32,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:32,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:29:32,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:29:32,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:29:32,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:32,590 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:32,590 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:32,591 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:32,591 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:32,592 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:32,658 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:32,833 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:29:32,854 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:32,862 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:32,863 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:32,863 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:29:32,864 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:32,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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 (= |__VERIFIER_assert_#in~cond| 0) (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) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 512)) (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| 0) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 512))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:32,868 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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 (= |__VERIFIER_assert_#in~cond| 0) (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) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 512)) (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| 0) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 512))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:32,868 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(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 (= |__VERIFIER_assert_#in~cond| 0) (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) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 512)) (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| 0) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 512))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:32,868 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:32,869 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:32,869 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:32,869 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:32,869 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:29:32,870 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(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 (= |__VERIFIER_assert_#in~cond| 0) (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) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 512)) (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| 0) (< v_main_~i~0_BEFORE_CALL_2 1024) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 512))))) [2019-10-07 13:29:32,870 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:29:32,870 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:33,179 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:33,180 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 24 [2019-10-07 13:29:33,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 13:29:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 13:29:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-10-07 13:29:33,183 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 24 states. [2019-10-07 13:29:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:34,598 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-10-07 13:29:34,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:29:34,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2019-10-07 13:29:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:34,600 INFO L225 Difference]: With dead ends: 64 [2019-10-07 13:29:34,600 INFO L226 Difference]: Without dead ends: 48 [2019-10-07 13:29:34,602 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=485, Invalid=1965, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 13:29:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-07 13:29:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-10-07 13:29:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:29:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-07 13:29:34,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 20 [2019-10-07 13:29:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:34,611 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-07 13:29:34,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 13:29:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-07 13:29:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:29:34,613 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:34,613 INFO L385 BasicCegarLoop]: trace histogram [10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:34,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:34,817 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1735843817, now seen corresponding path program 3 times [2019-10-07 13:29:34,817 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:34,817 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:34,818 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:34,818 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 13:29:34,967 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:34,968 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:34,968 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:35,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:35,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:35,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:29:35,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 13:29:35,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 13:29:35,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:35,370 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:35,370 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:35,371 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:35,371 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:35,371 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:35,409 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:35,560 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:29:35,570 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:35,575 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:35,575 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:35,579 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:29:35,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:35,580 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(and (<= __VERIFIER_assert_~cond 0) (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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_3 1024) (<= v_main_~i~0_BEFORE_CALL_3 512) (= 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)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_3 512)) (< v_main_~i~0_BEFORE_CALL_3 1024) (= 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)))) (<= 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:35,580 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(and (<= __VERIFIER_assert_~cond 0) (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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_3 1024) (<= v_main_~i~0_BEFORE_CALL_3 512) (= 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)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_3 512)) (< v_main_~i~0_BEFORE_CALL_3 1024) (= 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)))) (<= 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:35,581 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_3 1024) (<= v_main_~i~0_BEFORE_CALL_3 512) (= 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)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_3 512)) (< v_main_~i~0_BEFORE_CALL_3 1024) (= 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:35,581 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:35,581 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:35,581 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:35,582 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:35,582 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:29:35,582 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(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 (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_3 1024) (<= v_main_~i~0_BEFORE_CALL_3 512) (= 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)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_3 512)) (< v_main_~i~0_BEFORE_CALL_3 1024) (= 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:35,583 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:35,583 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:29:35,874 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:35,874 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 10] total 36 [2019-10-07 13:29:35,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-07 13:29:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-07 13:29:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 13:29:35,877 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 36 states. [2019-10-07 13:29:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:38,491 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2019-10-07 13:29:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-07 13:29:38,493 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 32 [2019-10-07 13:29:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:38,494 INFO L225 Difference]: With dead ends: 115 [2019-10-07 13:29:38,494 INFO L226 Difference]: Without dead ends: 90 [2019-10-07 13:29:38,498 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1556, Invalid=5250, Unknown=0, NotChecked=0, Total=6806 [2019-10-07 13:29:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-07 13:29:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 57. [2019-10-07 13:29:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:29:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-07 13:29:38,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2019-10-07 13:29:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:38,511 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-07 13:29:38,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-07 13:29:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-07 13:29:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:29:38,513 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:38,514 INFO L385 BasicCegarLoop]: trace histogram [22, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:38,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:38,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:38,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -705794281, now seen corresponding path program 4 times [2019-10-07 13:29:38,719 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:38,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:38,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:38,720 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 13:29:38,959 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:38,959 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:38,959 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:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:39,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:29:39,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-07 13:29:39,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-07 13:29:40,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:40,134 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:29:40,134 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:40,134 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:40,134 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:40,135 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:40,163 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:40,293 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:29:40,302 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:40,306 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:40,306 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:40,306 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:29:40,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:40,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(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 (= |__VERIFIER_assert_#in~cond| 0) (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 512) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)) (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 512)) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:40,307 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(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 (= |__VERIFIER_assert_#in~cond| 0) (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 512) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)) (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 512)) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:40,308 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(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 (= |__VERIFIER_assert_#in~cond| 0) (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 512) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)) (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 512)) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:40,308 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:40,308 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:40,308 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:40,308 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:40,309 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:29:40,309 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(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 (= |__VERIFIER_assert_#in~cond| 0) (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 512) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)) (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 512)) (<= 0 v_main_~i~0_BEFORE_CALL_4) (< v_main_~i~0_BEFORE_CALL_4 1024)))) [2019-10-07 13:29:40,309 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:29:40,309 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:29:40,797 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:40,797 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 25, 10] total 60 [2019-10-07 13:29:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-07 13:29:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-07 13:29:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2334, Unknown=0, NotChecked=0, Total=3540 [2019-10-07 13:29:40,808 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 60 states. [2019-10-07 13:29:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:46,791 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2019-10-07 13:29:46,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-07 13:29:46,793 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 56 [2019-10-07 13:29:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:46,794 INFO L225 Difference]: With dead ends: 217 [2019-10-07 13:29:46,795 INFO L226 Difference]: Without dead ends: 174 [2019-10-07 13:29:46,803 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5514 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5723, Invalid=16329, Unknown=0, NotChecked=0, Total=22052 [2019-10-07 13:29:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-07 13:29:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2019-10-07 13:29:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 13:29:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-10-07 13:29:46,821 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 56 [2019-10-07 13:29:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:46,822 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-10-07 13:29:46,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-07 13:29:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-10-07 13:29:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 13:29:46,825 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:46,826 INFO L385 BasicCegarLoop]: trace histogram [46, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:47,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:47,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash -97464717, now seen corresponding path program 5 times [2019-10-07 13:29:47,034 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:47,035 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 13:29:47,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:47,535 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:31:51,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:31:51,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:51,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-07 13:31:51,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 13:31:51,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 13:31:51,820 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:51,822 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:31:51,822 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:51,823 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:51,823 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:51,824 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:51,844 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:31:51,922 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:31:51,928 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:31:51,931 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:51,932 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:51,932 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:31:51,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:31:51,932 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(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.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_6 512) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024) (not (<= v_main_~i~0_BEFORE_CALL_6 512))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:51,933 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(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.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_6 512) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024) (not (<= v_main_~i~0_BEFORE_CALL_6 512))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:51,933 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(and (exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_6 512) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024) (not (<= v_main_~i~0_BEFORE_CALL_6 512))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:51,933 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:51,933 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:31:51,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:51,934 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:51,934 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:31:51,934 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(exists ((v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= v_main_~i~0_BEFORE_CALL_6 512) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ (* 4 v_main_~i~0_BEFORE_CALL_6) |v_main_~#A~0.offset_BEFORE_CALL_5|))) (<= 0 v_main_~i~0_BEFORE_CALL_6) (< v_main_~i~0_BEFORE_CALL_6 1024) (not (<= v_main_~i~0_BEFORE_CALL_6 512))))) [2019-10-07 13:31:51,934 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:31:51,935 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:31:52,282 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:52,283 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28, 10] total 63 [2019-10-07 13:31:52,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-07 13:31:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-07 13:31:52,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=2645, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:31:52,287 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 63 states. [2019-10-07 13:31:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:31:57,532 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2019-10-07 13:31:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-07 13:31:57,533 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 104 [2019-10-07 13:31:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:31:57,535 INFO L225 Difference]: With dead ends: 237 [2019-10-07 13:31:57,536 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 13:31:57,542 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5003, Invalid=15589, Unknown=0, NotChecked=0, Total=20592 [2019-10-07 13:31:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 13:31:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 13:31:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 13:31:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-10-07 13:31:57,570 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 104 [2019-10-07 13:31:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:31:57,571 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-10-07 13:31:57,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-07 13:31:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-10-07 13:31:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-07 13:31:57,573 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:31:57,574 INFO L385 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:31:57,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:57,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:31:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:31:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash -538631256, now seen corresponding path program 6 times [2019-10-07 13:31:57,776 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:31:57,776 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:57,776 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:57,777 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:31:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-07 13:31:59,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:59,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:31:59,224 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:59,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:31:59,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:59,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-07 13:31:59,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-10-07 13:31:59,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-10-07 13:32:02,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:32:02,161 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:32:02,162 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:32:02,162 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:32:02,162 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:32:02,162 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:32:02,186 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:32:02,260 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:32:02,266 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:32:02,268 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:32:02,268 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:32:02,269 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:32:02,269 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:32:02,269 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(and (<= __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) (exists ((v_main_~i~0_BEFORE_CALL_7 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) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (not (<= v_main_~i~0_BEFORE_CALL_7 512))) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (<= v_main_~i~0_BEFORE_CALL_7 512) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7))))) [2019-10-07 13:32:02,269 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(and (<= __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) (exists ((v_main_~i~0_BEFORE_CALL_7 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) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (not (<= v_main_~i~0_BEFORE_CALL_7 512))) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (<= v_main_~i~0_BEFORE_CALL_7 512) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7))))) [2019-10-07 13:32:02,269 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_main_~i~0_BEFORE_CALL_7 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) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (not (<= v_main_~i~0_BEFORE_CALL_7 512))) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (<= v_main_~i~0_BEFORE_CALL_7 512) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7))))) [2019-10-07 13:32:02,271 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:32:02,271 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:32:02,271 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:32:02,271 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:32:02,271 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:32:02,272 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(exists ((v_main_~i~0_BEFORE_CALL_7 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) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7) (not (<= v_main_~i~0_BEFORE_CALL_7 512))) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ (* 4 v_main_~i~0_BEFORE_CALL_7) |v_main_~#A~0.offset_BEFORE_CALL_6|)) 0) (<= v_main_~i~0_BEFORE_CALL_7 512) (< v_main_~i~0_BEFORE_CALL_7 1024) (<= 0 v_main_~i~0_BEFORE_CALL_7)))) [2019-10-07 13:32:02,272 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:32:02,273 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:32:02,746 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:32:02,746 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51, 51, 10] total 112 [2019-10-07 13:32:02,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-10-07 13:32:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-10-07 13:32:02,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5080, Invalid=7352, Unknown=0, NotChecked=0, Total=12432 [2019-10-07 13:32:02,751 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 112 states. [2019-10-07 13:32:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:17,928 INFO L93 Difference]: Finished difference Result 462 states and 563 transitions. [2019-10-07 13:32:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-10-07 13:32:17,929 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 156 [2019-10-07 13:32:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:17,932 INFO L225 Difference]: With dead ends: 462 [2019-10-07 13:32:17,932 INFO L226 Difference]: Without dead ends: 356 [2019-10-07 13:32:17,937 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16756 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=19370, Invalid=52186, Unknown=0, NotChecked=0, Total=71556 [2019-10-07 13:32:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-07 13:32:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 209. [2019-10-07 13:32:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-07 13:32:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-10-07 13:32:17,973 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 156 [2019-10-07 13:32:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:17,974 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-10-07 13:32:17,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-10-07 13:32:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-10-07 13:32:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-07 13:32:17,977 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:32:17,978 INFO L385 BasicCegarLoop]: trace histogram [98, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:32:18,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:18,183 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:32:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:32:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1188184859, now seen corresponding path program 7 times [2019-10-07 13:32:18,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:32:18,184 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:18,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:18,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:32:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7301 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-07 13:32:19,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:19,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:32:19,388 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:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:19,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-07 13:32:19,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:32:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7301 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-10-07 13:32:22,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7301 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-10-07 13:32:32,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:32:32,791 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:32:32,791 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:32:32,791 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:32:32,792 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:32:32,792 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:32:32,816 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:32:32,879 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2019-10-07 13:32:32,885 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:32:32,887 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:32:32,887 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:32:32,888 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:32:32,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:32:32,888 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 142#(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_~i~0_BEFORE_CALL_8 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_8 512)) (<= 0 v_main_~i~0_BEFORE_CALL_8)) (and (<= v_main_~i~0_BEFORE_CALL_8 512) (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (<= 0 v_main_~i~0_BEFORE_CALL_8)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:32,888 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 137#(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_~i~0_BEFORE_CALL_8 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_8 512)) (<= 0 v_main_~i~0_BEFORE_CALL_8)) (and (<= v_main_~i~0_BEFORE_CALL_8 512) (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (<= 0 v_main_~i~0_BEFORE_CALL_8)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:32,889 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 132#(and (exists ((v_main_~i~0_BEFORE_CALL_8 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_8 512)) (<= 0 v_main_~i~0_BEFORE_CALL_8)) (and (<= v_main_~i~0_BEFORE_CALL_8 512) (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (<= 0 v_main_~i~0_BEFORE_CALL_8)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:32,889 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:32:32,889 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:32:32,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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:32:32,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:32:32,890 INFO L193 IcfgInterpreter]: Reachable states at location L15-7 satisfy 122#(and (or (and (<= 0 main_~i~0) (not (< main_~i~0 1024))) (and (<= 0 main_~i~0) (= 0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))))) (or (<= main_~i~0 1024) (<= 1024 main_~i~0))) [2019-10-07 13:32:32,890 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 127#(exists ((v_main_~i~0_BEFORE_CALL_8 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (not (<= v_main_~i~0_BEFORE_CALL_8 512)) (<= 0 v_main_~i~0_BEFORE_CALL_8)) (and (<= v_main_~i~0_BEFORE_CALL_8 512) (= |__VERIFIER_assert_#in~cond| 1) (< v_main_~i~0_BEFORE_CALL_8 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) (+ (* 4 v_main_~i~0_BEFORE_CALL_8) |v_main_~#A~0.offset_BEFORE_CALL_7|)) 0) (<= 0 v_main_~i~0_BEFORE_CALL_8)))) [2019-10-07 13:32:32,890 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-07 13:32:32,890 INFO L193 IcfgInterpreter]: Reachable states at location L15-6 satisfy 109#(<= 0 main_~i~0) [2019-10-07 13:32:33,667 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:32:33,668 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 101, 101, 10] total 212 [2019-10-07 13:32:33,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 212 states [2019-10-07 13:32:33,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2019-10-07 13:32:33,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20130, Invalid=24602, Unknown=0, NotChecked=0, Total=44732 [2019-10-07 13:32:33,676 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 212 states. [2019-10-07 13:33:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:38,505 INFO L93 Difference]: Finished difference Result 863 states and 1113 transitions. [2019-10-07 13:33:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 360 states. [2019-10-07 13:33:38,506 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 208 [2019-10-07 13:33:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:38,510 INFO L225 Difference]: With dead ends: 863 [2019-10-07 13:33:38,510 INFO L226 Difference]: Without dead ends: 706 [2019-10-07 13:33:38,519 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77201 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=94814, Invalid=226108, Unknown=0, NotChecked=0, Total=320922 [2019-10-07 13:33:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-07 13:33:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 409. [2019-10-07 13:33:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:33:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2019-10-07 13:33:38,584 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 208 [2019-10-07 13:33:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:38,584 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2019-10-07 13:33:38,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 212 states. [2019-10-07 13:33:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2019-10-07 13:33:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-10-07 13:33:38,592 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:38,593 INFO L385 BasicCegarLoop]: trace histogram [198, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:38,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:38,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1938743567, now seen corresponding path program 8 times [2019-10-07 13:33:38,799 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:38,800 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:38,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:38,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29601 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 19701 trivial. 0 not checked. [2019-10-07 13:33:43,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:43,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:43,307 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