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/array-industry-pattern/array_assert_loop_dep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:30:21,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:30:21,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:30:21,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:30:21,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:30:21,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:30:21,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:30:21,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:30:21,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:30:21,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:30:21,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:30:21,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:30:21,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:30:21,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:30:21,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:30:21,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:30:21,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:30:21,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:30:21,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:30:21,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:30:21,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:30:21,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:30:21,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:30:21,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:30:21,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:30:21,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:30:21,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:30:21,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:30:21,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:30:21,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:30:21,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:30:21,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:30:21,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:30:21,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:30:21,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:30:21,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:30:21,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:30:21,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:30:21,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:30:21,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:30:21,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:30:21,404 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 00:30:21,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:30:21,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:30:21,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:30:21,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:30:21,440 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:30:21,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:30:21,441 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:30:21,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:30:21,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:30:21,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:30:21,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:30:21,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:30:21,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:30:21,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:30:21,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:30:21,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:30:21,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:30:21,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:30:21,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:30:21,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:30:21,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:30:21,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:30:21,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:30:21,445 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 00:30:21,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:30:21,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:30:21,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:30:21,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:30:21,788 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:30:21,789 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep.i [2019-10-07 00:30:21,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aaf0fd/0a8b94d48ab943f6b5579df9d6b0dd0a/FLAGe76d30d8f [2019-10-07 00:30:22,298 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:30:22,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep.i [2019-10-07 00:30:22,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aaf0fd/0a8b94d48ab943f6b5579df9d6b0dd0a/FLAGe76d30d8f [2019-10-07 00:30:22,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106aaf0fd/0a8b94d48ab943f6b5579df9d6b0dd0a [2019-10-07 00:30:22,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:30:22,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:30:22,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:30:22,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:30:22,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:30:22,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:30:22" (1/1) ... [2019-10-07 00:30:22,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382d0cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:22, skipping insertion in model container [2019-10-07 00:30:22,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:30:22" (1/1) ... [2019-10-07 00:30:22,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:30:22,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:30:22,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:30:23,002 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:30:23,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:30:23,053 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:30:23,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23 WrapperNode [2019-10-07 00:30:23,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:30:23,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:30:23,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:30:23,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:30:23,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (1/1) ... [2019-10-07 00:30:23,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:30:23,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:30:23,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:30:23,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:30:23,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (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 00:30:23,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:30:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:30:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:30:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:30:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:30:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:30:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:30:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:30:23,601 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:30:23,602 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:30:23,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:30:23 BoogieIcfgContainer [2019-10-07 00:30:23,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:30:23,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:30:23,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:30:23,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:30:23,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:30:22" (1/3) ... [2019-10-07 00:30:23,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48266f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:30:23, skipping insertion in model container [2019-10-07 00:30:23,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:30:23" (2/3) ... [2019-10-07 00:30:23,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48266f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:30:23, skipping insertion in model container [2019-10-07 00:30:23,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:30:23" (3/3) ... [2019-10-07 00:30:23,612 INFO L109 eAbstractionObserver]: Analyzing ICFG array_assert_loop_dep.i [2019-10-07 00:30:23,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:30:23,630 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:30:23,643 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:30:23,682 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:30:23,682 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:30:23,682 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:30:23,682 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:30:23,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:30:23,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:30:23,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:30:23,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:30:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 00:30:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 00:30:23,708 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:23,709 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:23,714 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1038582055, now seen corresponding path program 1 times [2019-10-07 00:30:23,730 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:23,730 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:23,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:23,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:23,894 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 00:30:23,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:23,895 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:30:23,896 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:30:23,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:30:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:30:23,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:30:23,912 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-07 00:30:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:23,984 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-07 00:30:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:30:23,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 00:30:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:23,995 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:30:23,995 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:30:23,998 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 00:30:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:30:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-07 00:30:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 00:30:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 00:30:24,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-07 00:30:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:24,036 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 00:30:24,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:30:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 00:30:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:30:24,037 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:24,038 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:24,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1360247690, now seen corresponding path program 1 times [2019-10-07 00:30:24,039 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:24,039 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:24,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:24,040 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:24,114 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:24,114 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:24,115 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 00:30:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:24,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:30:24,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:24,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:24,234 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:24,260 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:30:24,261 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:24,268 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:24,282 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:24,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:24,460 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:24,876 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:30:24,901 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:24,913 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:24,913 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:24,914 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:24,915 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 00:30:24,915 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 00:30:24,915 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:30:24,916 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:24,917 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:24,917 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:24,917 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:24,918 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:24,918 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:24,919 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:30:24,920 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:30:25,379 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:25,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-07 00:30:25,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:30:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:30:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:30:25,387 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 17 states. [2019-10-07 00:30:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:26,139 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-07 00:30:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 00:30:26,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-10-07 00:30:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:26,142 INFO L225 Difference]: With dead ends: 44 [2019-10-07 00:30:26,143 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 00:30:26,147 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-10-07 00:30:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 00:30:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2019-10-07 00:30:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:30:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-07 00:30:26,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2019-10-07 00:30:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-07 00:30:26,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:30:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-07 00:30:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:30:26,165 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:26,165 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:26,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:26,367 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1001094681, now seen corresponding path program 2 times [2019-10-07 00:30:26,369 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:26,369 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:26,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:26,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:26,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:26,440 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:26,440 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 00:30:26,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:30:26,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:30:26,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:30:26,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:26,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:26,576 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:26,578 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:30:26,578 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:26,579 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:26,579 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:26,579 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:26,631 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:26,862 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:30:26,878 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:26,887 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:26,887 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:26,888 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 10 (select (select |#memory_int| v_prenex_2) 0)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:26,888 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 00:30:26,888 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 00:30:26,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:30:26,889 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 10 (select (select |#memory_int| v_prenex_2) 0)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:26,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:26,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:26,889 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:26,891 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 10 (select (select |#memory_int| v_prenex_2) 0)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:26,891 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:26,892 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= 10 (select (select |#memory_int| v_prenex_2) 0)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 10 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:30:26,892 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:30:27,272 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:27,272 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 23 [2019-10-07 00:30:27,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:30:27,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:30:27,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:30:27,274 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 23 states. [2019-10-07 00:30:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:28,208 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2019-10-07 00:30:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:30:28,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2019-10-07 00:30:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:28,212 INFO L225 Difference]: With dead ends: 68 [2019-10-07 00:30:28,212 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 00:30:28,213 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:30:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 00:30:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 25. [2019-10-07 00:30:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:30:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 00:30:28,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-10-07 00:30:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:28,224 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 00:30:28,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:30:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 00:30:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:30:28,225 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:28,225 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:28,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:28,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 804785927, now seen corresponding path program 3 times [2019-10-07 00:30:28,436 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:28,437 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:28,437 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:28,437 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:28,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:28,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:28,624 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 00:30:28,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:30:28,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:30:28,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:30:28,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:28,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:28,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:28,896 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:30:28,897 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:28,897 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:28,897 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:28,898 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:28,933 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:29,092 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:30:29,119 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:29,129 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:29,129 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:29,130 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:29,130 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 00:30:29,130 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 00:30:29,130 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:30:29,131 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:29,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:29,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:29,134 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:29,134 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:29,135 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:29,135 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:30:29,139 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:30:29,512 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:29,512 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 10] total 35 [2019-10-07 00:30:29,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:30:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:30:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:30:29,514 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-10-07 00:30:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:31,323 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2019-10-07 00:30:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 00:30:31,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 21 [2019-10-07 00:30:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:31,325 INFO L225 Difference]: With dead ends: 116 [2019-10-07 00:30:31,325 INFO L226 Difference]: Without dead ends: 107 [2019-10-07 00:30:31,328 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1063, Invalid=2843, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 00:30:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-07 00:30:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 37. [2019-10-07 00:30:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 00:30:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-07 00:30:31,350 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-10-07 00:30:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:31,350 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-07 00:30:31,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:30:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-07 00:30:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 00:30:31,352 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:31,353 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:31,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:31,556 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1965153977, now seen corresponding path program 4 times [2019-10-07 00:30:31,557 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:31,557 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:31,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:31,557 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:31,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:31,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:31,932 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 00:30:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:31,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:30:32,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:32,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:32,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:32,667 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:30:32,667 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:32,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:32,668 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:32,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:32,697 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:32,823 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:30:32,831 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:32,840 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:32,840 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:32,840 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:32,841 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 00:30:32,841 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 00:30:32,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:30:32,841 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:32,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:32,842 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:32,842 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:32,842 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:32,843 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:30:32,845 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 10) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:30:32,845 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:30:33,250 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:33,251 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 10] total 59 [2019-10-07 00:30:33,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-07 00:30:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-07 00:30:33,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2123, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:30:33,257 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 59 states. [2019-10-07 00:30:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:37,653 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2019-10-07 00:30:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-07 00:30:37,655 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 33 [2019-10-07 00:30:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:37,658 INFO L225 Difference]: With dead ends: 212 [2019-10-07 00:30:37,658 INFO L226 Difference]: Without dead ends: 203 [2019-10-07 00:30:37,663 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2746 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3787, Invalid=8423, Unknown=0, NotChecked=0, Total=12210 [2019-10-07 00:30:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-07 00:30:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 61. [2019-10-07 00:30:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-07 00:30:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-10-07 00:30:37,693 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 33 [2019-10-07 00:30:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:37,694 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-10-07 00:30:37,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-07 00:30:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-10-07 00:30:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 00:30:37,696 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:37,696 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:37,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:37,900 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1906432569, now seen corresponding path program 5 times [2019-10-07 00:30:37,901 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:37,902 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:37,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:37,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:30:38,870 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:38,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:38,871 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 00:31:09,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:31:09,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:31:09,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:31:09,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:31:09,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:31:11,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:11,591 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:31:11,591 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:11,592 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:11,592 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:11,592 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:11,620 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:31:11,747 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:31:11,762 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:31:11,768 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:11,768 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:11,768 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| v_prenex_5) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:11,768 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 00:31:11,769 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 00:31:11,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:31:11,769 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| v_prenex_5) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:11,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:11,770 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:31:11,770 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| v_prenex_5) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:11,770 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:31:11,770 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:31:11,770 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= (select (select |#memory_int| v_prenex_5) 0) 10)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:31:11,771 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:31:12,290 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:12,291 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 10] total 107 [2019-10-07 00:31:12,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-07 00:31:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-07 00:31:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4875, Invalid=6467, Unknown=0, NotChecked=0, Total=11342 [2019-10-07 00:31:12,297 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 107 states. [2019-10-07 00:31:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:31:24,001 INFO L93 Difference]: Finished difference Result 404 states and 545 transitions. [2019-10-07 00:31:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-07 00:31:24,001 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 57 [2019-10-07 00:31:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:31:24,005 INFO L225 Difference]: With dead ends: 404 [2019-10-07 00:31:24,006 INFO L226 Difference]: Without dead ends: 395 [2019-10-07 00:31:24,014 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8398 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14419, Invalid=28223, Unknown=0, NotChecked=0, Total=42642 [2019-10-07 00:31:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-07 00:31:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 109. [2019-10-07 00:31:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-07 00:31:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-10-07 00:31:24,074 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 57 [2019-10-07 00:31:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:31:24,074 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-10-07 00:31:24,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-07 00:31:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-10-07 00:31:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 00:31:24,078 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:31:24,078 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:31:24,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:24,293 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:31:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:31:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -638734649, now seen corresponding path program 6 times [2019-10-07 00:31:24,294 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:31:24,294 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:24,294 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:24,294 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:31:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:31:27,730 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:27,730 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:31:27,730 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 00:31:27,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:31:27,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:31:27,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:31:27,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:31:27,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:31:37,347 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:37,349 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:31:37,349 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:37,349 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:37,349 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:37,350 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:37,367 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:31:37,489 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:31:37,498 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:31:37,503 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:37,503 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:37,503 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 00:31:37,504 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 00:31:37,504 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_6) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:37,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:31:37,504 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_6) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:37,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:37,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:31:37,505 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:31:37,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_6) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:37,506 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:31:37,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_6) 0) 10) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:31:37,506 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:31:38,577 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:38,577 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 10] total 203 [2019-10-07 00:31:38,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-07 00:31:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-07 00:31:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18939, Invalid=22067, Unknown=0, NotChecked=0, Total=41006 [2019-10-07 00:31:38,588 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 203 states. [2019-10-07 00:32:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:32:21,599 INFO L93 Difference]: Finished difference Result 788 states and 1073 transitions. [2019-10-07 00:32:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-10-07 00:32:21,599 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 105 [2019-10-07 00:32:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:32:21,606 INFO L225 Difference]: With dead ends: 788 [2019-10-07 00:32:21,606 INFO L226 Difference]: Without dead ends: 779 [2019-10-07 00:32:21,613 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28342 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=56419, Invalid=102383, Unknown=0, NotChecked=0, Total=158802 [2019-10-07 00:32:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-07 00:32:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 205. [2019-10-07 00:32:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-07 00:32:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-10-07 00:32:21,683 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 105 [2019-10-07 00:32:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:32:21,684 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-10-07 00:32:21,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 203 states. [2019-10-07 00:32:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-10-07 00:32:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 00:32:21,687 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:32:21,687 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:32:21,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:32:21,896 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:32:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:32:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 826982599, now seen corresponding path program 7 times [2019-10-07 00:32:21,897 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:32:21,897 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:32:21,897 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:32:21,897 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:32:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:32:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:32:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:32:34,773 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:32:34,773 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:32:34,773 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 00:32:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:32:35,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 00:32:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:32:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:32:35,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:33:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:33:12,967 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:33:12,969 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 00:33:12,969 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:33:12,969 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:33:12,970 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:33:12,970 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:33:12,994 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:33:13,080 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:33:13,089 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:33:13,094 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:33:13,094 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:33:13,094 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 00:33:13,095 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 00:33:13,095 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_7) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:33:13,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(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 00:33:13,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:33:13,096 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_7) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:33:13,096 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:33:13,096 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 81#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= 0 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:33:13,096 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_7) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:33:13,096 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:33:13,097 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_7) 0) 10)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 10) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:33:13,097 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:33:14,361 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:33:14,362 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 10] total 395 [2019-10-07 00:33:14,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 395 states [2019-10-07 00:33:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 395 interpolants. [2019-10-07 00:33:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74715, Invalid=80915, Unknown=0, NotChecked=0, Total=155630 [2019-10-07 00:33:14,379 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 395 states. [2019-10-07 00:37:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:37:16,212 INFO L93 Difference]: Finished difference Result 1556 states and 2129 transitions. [2019-10-07 00:37:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2019-10-07 00:37:16,212 INFO L78 Accepts]: Start accepts. Automaton has 395 states. Word has length 201 [2019-10-07 00:37:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:37:16,223 INFO L225 Difference]: With dead ends: 1556 [2019-10-07 00:37:16,224 INFO L226 Difference]: Without dead ends: 1547 [2019-10-07 00:37:16,247 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1184 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 781 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102790 ImplicationChecksByTransitivity, 141.5s TimeCoverageRelationStatistics Valid=223363, Invalid=388943, Unknown=0, NotChecked=0, Total=612306 [2019-10-07 00:37:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-10-07 00:37:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 397. [2019-10-07 00:37:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-07 00:37:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2019-10-07 00:37:16,371 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 201 [2019-10-07 00:37:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:37:16,372 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2019-10-07 00:37:16,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 395 states. [2019-10-07 00:37:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2019-10-07 00:37:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-07 00:37:16,380 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:37:16,380 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:37:16,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:37:16,585 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:37:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:37:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1358750919, now seen corresponding path program 8 times [2019-10-07 00:37:16,586 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:37:16,586 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:37:16,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:37:16,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:37:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:37:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:38:07,997 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:07,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:07,998 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