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-examples/standard_copy9_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:44:05,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:44:05,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:44:05,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:44:05,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:44:05,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:44:05,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:44:05,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:44:05,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:44:05,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:44:05,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:44:05,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:44:05,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:44:05,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:44:05,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:44:05,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:44:05,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:44:05,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:44:05,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:44:05,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:44:05,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:44:05,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:44:05,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:44:05,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:44:05,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:44:05,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:44:05,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:44:06,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:44:06,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:44:06,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:44:06,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:44:06,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:44:06,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:44:06,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:44:06,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:44:06,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:44:06,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:44:06,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:44:06,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:44:06,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:44:06,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:44:06,014 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-06 23:44:06,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:44:06,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:44:06,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:44:06,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:44:06,045 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:44:06,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:44:06,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:44:06,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:44:06,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:44:06,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:44:06,047 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:44:06,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:44:06,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:44:06,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:44:06,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:44:06,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:44:06,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:44:06,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:44:06,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:44:06,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:44:06,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:44:06,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:44:06,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:44:06,049 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-06 23:44:06,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:44:06,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:44:06,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:44:06,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:44:06,362 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:44:06,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_ground-2.i [2019-10-06 23:44:06,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db722f08f/7d55e675eeac4711989e34efc1e41d9b/FLAG9d7d7c6f5 [2019-10-06 23:44:07,002 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:44:07,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_ground-2.i [2019-10-06 23:44:07,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db722f08f/7d55e675eeac4711989e34efc1e41d9b/FLAG9d7d7c6f5 [2019-10-06 23:44:07,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db722f08f/7d55e675eeac4711989e34efc1e41d9b [2019-10-06 23:44:07,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:44:07,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:44:07,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:44:07,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:44:07,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:44:07,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ae0c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07, skipping insertion in model container [2019-10-06 23:44:07,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,367 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:44:07,388 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:44:07,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:44:07,604 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:44:07,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:44:07,750 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:44:07,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07 WrapperNode [2019-10-06 23:44:07,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:44:07,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:44:07,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:44:07,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:44:07,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (1/1) ... [2019-10-06 23:44:07,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:44:07,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:44:07,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:44:07,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:44:07,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (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-06 23:44:07,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:44:07,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:44:07,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:44:07,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:44:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:44:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:44:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:44:08,601 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:44:08,602 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-06 23:44:08,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:44:08 BoogieIcfgContainer [2019-10-06 23:44:08,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:44:08,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:44:08,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:44:08,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:44:08,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:44:07" (1/3) ... [2019-10-06 23:44:08,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ba51ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:44:08, skipping insertion in model container [2019-10-06 23:44:08,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:44:07" (2/3) ... [2019-10-06 23:44:08,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ba51ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:44:08, skipping insertion in model container [2019-10-06 23:44:08,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:44:08" (3/3) ... [2019-10-06 23:44:08,613 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy9_ground-2.i [2019-10-06 23:44:08,624 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:44:08,634 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:44:08,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:44:08,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:44:08,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:44:08,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:44:08,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:44:08,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:44:08,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:44:08,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:44:08,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:44:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-06 23:44:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:44:08,717 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:08,719 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:08,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1608130408, now seen corresponding path program 1 times [2019-10-06 23:44:08,742 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:08,743 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:08,743 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:08,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:08,941 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-06 23:44:08,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:08,943 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:44:08,943 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:44:08,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:44:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:44:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:44:08,967 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-06 23:44:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:09,020 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-10-06 23:44:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:44:09,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:44:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:09,033 INFO L225 Difference]: With dead ends: 49 [2019-10-06 23:44:09,033 INFO L226 Difference]: Without dead ends: 25 [2019-10-06 23:44:09,040 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-06 23:44:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-06 23:44:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-06 23:44:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:44:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-06 23:44:09,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 20 [2019-10-06 23:44:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:09,094 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-06 23:44:09,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:44:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-10-06 23:44:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:44:09,096 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:09,096 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:09,096 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1792470151, now seen corresponding path program 1 times [2019-10-06 23:44:09,097 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:09,097 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:09,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:09,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:44:09,183 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:09,183 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:44:09,183 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:44:09,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:44:09,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:44:09,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:44:09,188 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 3 states. [2019-10-06 23:44:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:09,261 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2019-10-06 23:44:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:44:09,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-06 23:44:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:09,264 INFO L225 Difference]: With dead ends: 51 [2019-10-06 23:44:09,264 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:44:09,265 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-06 23:44:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:44:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-06 23:44:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:44:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-10-06 23:44:09,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 21 [2019-10-06 23:44:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:09,275 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-06 23:44:09,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:44:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-10-06 23:44:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:44:09,277 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:09,277 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:09,277 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1489973918, now seen corresponding path program 1 times [2019-10-06 23:44:09,278 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:09,279 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:09,279 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:09,279 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:44:09,421 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:09,421 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:09,421 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-06 23:44:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:09,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:44:09,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:44:09,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:44:09,593 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:09,618 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:09,618 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:09,625 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:09,634 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:09,635 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:09,791 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:10,379 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:10,664 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:11,007 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:11,280 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:11,774 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:12,579 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:12,592 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:12,603 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:12,603 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:12,603 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:12,604 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:12,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:12,605 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,606 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:12,606 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:12,606 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,606 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,607 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:12,607 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-06 23:44:12,608 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-06 23:44:12,608 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:12,608 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,608 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,608 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:12,609 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:12,609 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,609 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:44:12,609 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,610 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,610 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:12,917 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:12,917 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:44:12,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:44:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:44:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:44:12,927 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 17 states. [2019-10-06 23:44:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:13,656 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-10-06 23:44:13,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:44:13,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-06 23:44:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:13,658 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:44:13,658 INFO L226 Difference]: Without dead ends: 46 [2019-10-06 23:44:13,660 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:44:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-06 23:44:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-06 23:44:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-06 23:44:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-10-06 23:44:13,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 30 [2019-10-06 23:44:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:13,670 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-10-06 23:44:13,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:44:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-10-06 23:44:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-06 23:44:13,672 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:13,672 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:13,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:13,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1082535905, now seen corresponding path program 2 times [2019-10-06 23:44:13,877 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:13,878 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:13,878 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:13,878 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:44:14,038 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:14,038 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:14,038 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-06 23:44:14,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:44:14,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:14,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:44:14,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:44:14,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:44:14,257 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:14,262 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:14,263 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:14,264 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:14,265 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:14,265 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:14,347 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:15,176 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:15,452 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:16,525 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:16,534 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:16,538 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:16,538 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:16,539 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:16,539 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 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-06 23:44:16,539 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:16,539 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,540 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:16,540 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:16,540 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,540 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,541 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 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-06 23:44:16,541 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-06 23:44:16,541 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-06 23:44:16,542 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:16,542 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,542 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,542 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:16,543 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:16,543 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,543 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) [2019-10-06 23:44:16,543 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,543 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,544 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:16,878 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:16,878 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-06 23:44:16,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-06 23:44:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-06 23:44:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:44:16,881 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 21 states. [2019-10-06 23:44:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:18,091 INFO L93 Difference]: Finished difference Result 101 states and 148 transitions. [2019-10-06 23:44:18,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:44:18,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-10-06 23:44:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:18,093 INFO L225 Difference]: With dead ends: 101 [2019-10-06 23:44:18,093 INFO L226 Difference]: Without dead ends: 74 [2019-10-06 23:44:18,095 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:44:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-06 23:44:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2019-10-06 23:44:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:44:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-10-06 23:44:18,109 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 33 [2019-10-06 23:44:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:18,110 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-10-06 23:44:18,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-06 23:44:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-10-06 23:44:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-06 23:44:18,112 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:18,112 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:18,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:18,344 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -555202041, now seen corresponding path program 3 times [2019-10-06 23:44:18,345 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:18,345 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:18,345 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:18,345 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:18,536 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:18,536 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:18,536 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-06 23:44:18,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:44:18,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:18,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:44:18,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:18,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:18,781 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:18,783 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:18,784 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:18,784 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:18,784 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:18,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:18,809 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:20,661 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:20,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:20,670 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:20,670 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:20,670 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:20,671 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:20,671 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:20,671 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,671 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:20,671 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:20,672 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,672 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,672 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:20,672 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-06 23:44:20,672 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-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,674 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) [2019-10-06 23:44:20,674 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,674 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,674 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,982 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:20,982 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:44:20,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:44:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:44:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:44:20,985 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-10-06 23:44:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:21,931 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2019-10-06 23:44:21,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:44:21,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2019-10-06 23:44:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:21,934 INFO L225 Difference]: With dead ends: 135 [2019-10-06 23:44:21,934 INFO L226 Difference]: Without dead ends: 81 [2019-10-06 23:44:21,936 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:44:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-06 23:44:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-06 23:44:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-06 23:44:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-10-06 23:44:21,948 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 61 [2019-10-06 23:44:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-10-06 23:44:21,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:44:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-10-06 23:44:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:44:21,950 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:21,951 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:22,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:22,155 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1224243352, now seen corresponding path program 4 times [2019-10-06 23:44:22,156 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:22,156 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:22,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:22,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:22,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:22,350 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:22,350 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-06 23:44:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:22,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:44:22,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:22,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:22,804 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:22,806 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:22,806 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:22,807 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:22,807 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:22,807 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:22,831 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:23,692 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:24,750 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:24,756 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:24,758 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:24,758 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:24,759 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:24,759 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:24,759 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:24,759 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,760 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:24,760 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:24,760 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,760 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,761 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:24,761 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-06 23:44:24,761 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-06 23:44:24,761 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,762 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:44:24,763 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,763 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:24,763 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:25,062 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:25,063 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:44:25,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:44:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:44:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:44:25,066 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 39 states. [2019-10-06 23:44:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:26,604 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2019-10-06 23:44:26,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:44:26,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2019-10-06 23:44:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:26,605 INFO L225 Difference]: With dead ends: 149 [2019-10-06 23:44:26,606 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:44:26,609 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:44:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:44:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2019-10-06 23:44:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-06 23:44:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2019-10-06 23:44:26,621 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 68 [2019-10-06 23:44:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:26,621 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2019-10-06 23:44:26,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:44:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2019-10-06 23:44:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-06 23:44:26,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:26,623 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:26,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:26,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1549757064, now seen corresponding path program 5 times [2019-10-06 23:44:26,829 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:26,829 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:26,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:26,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:44:27,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:27,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:27,320 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-06 23:44:27,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:44:27,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:27,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:44:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-10-06 23:44:27,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-10-06 23:44:27,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:27,853 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:27,853 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:27,854 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:27,854 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:27,854 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:27,881 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:29,760 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:29,770 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:29,773 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:29,774 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:29,774 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:29,774 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-06 23:44:29,774 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:29,775 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,775 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:29,775 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:29,775 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,775 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,776 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-06 23:44:29,776 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-06 23:44:29,776 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-06 23:44:29,776 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:29,776 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,777 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,777 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:29,777 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:29,777 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,777 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-06 23:44:29,778 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,778 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:29,778 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:30,210 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:30,210 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-06 23:44:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-06 23:44:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-06 23:44:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:44:30,214 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 49 states. [2019-10-06 23:44:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:33,102 INFO L93 Difference]: Finished difference Result 204 states and 278 transitions. [2019-10-06 23:44:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-06 23:44:33,103 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 82 [2019-10-06 23:44:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:33,105 INFO L225 Difference]: With dead ends: 204 [2019-10-06 23:44:33,105 INFO L226 Difference]: Without dead ends: 150 [2019-10-06 23:44:33,109 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-06 23:44:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-06 23:44:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2019-10-06 23:44:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-06 23:44:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2019-10-06 23:44:33,126 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 82 [2019-10-06 23:44:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:33,127 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2019-10-06 23:44:33,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-06 23:44:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2019-10-06 23:44:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-06 23:44:33,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:33,130 INFO L385 BasicCegarLoop]: trace histogram [27, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:33,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:33,334 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1276829511, now seen corresponding path program 6 times [2019-10-06 23:44:33,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:33,335 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:33,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:33,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:33,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:33,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:33,883 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-06 23:44:34,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:44:34,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:34,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:44:34,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:34,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:35,081 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:35,083 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:35,083 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:35,084 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:35,084 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:35,084 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:35,100 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:35,930 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:36,166 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:36,389 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:37,016 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:37,025 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:37,043 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:37,043 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:37,043 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:37,044 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:37,044 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:37,044 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,044 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:37,044 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:37,045 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,045 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:37,046 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,046 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-06 23:44:37,046 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-06 23:44:37,046 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,047 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:37,047 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:37,047 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,048 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:37,048 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,048 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) [2019-10-06 23:44:37,049 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,049 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,049 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:37,649 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:37,649 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:44:37,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:44:37,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:44:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:44:37,655 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 69 states. [2019-10-06 23:44:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:41,372 INFO L93 Difference]: Finished difference Result 287 states and 335 transitions. [2019-10-06 23:44:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:44:41,373 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 137 [2019-10-06 23:44:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:41,375 INFO L225 Difference]: With dead ends: 287 [2019-10-06 23:44:41,376 INFO L226 Difference]: Without dead ends: 179 [2019-10-06 23:44:41,380 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:44:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-06 23:44:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2019-10-06 23:44:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-06 23:44:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2019-10-06 23:44:41,401 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 137 [2019-10-06 23:44:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:41,402 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2019-10-06 23:44:41,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:44:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2019-10-06 23:44:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-06 23:44:41,405 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:41,405 INFO L385 BasicCegarLoop]: trace histogram [56, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:41,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:41,612 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1152654792, now seen corresponding path program 7 times [2019-10-06 23:44:41,612 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:41,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:41,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:41,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2091 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:43,123 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:43,123 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:43,123 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-06 23:44:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:43,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:44:43,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2091 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:43,484 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2091 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:44:47,112 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:47,114 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:47,114 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:47,114 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:47,115 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:47,115 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:47,137 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:48,942 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:48,947 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:48,950 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:48,950 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:48,950 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:48,950 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:48,951 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:48,951 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,951 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:44:48,951 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:48,951 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,952 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:48,952 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,952 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-06 23:44:48,952 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-06 23:44:48,952 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,952 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:48,953 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:49,550 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:49,550 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:44:49,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:44:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:44:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:44:49,558 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand 127 states. [2019-10-06 23:44:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:59,578 INFO L93 Difference]: Finished difference Result 345 states and 422 transitions. [2019-10-06 23:44:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:44:59,584 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 166 [2019-10-06 23:44:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:59,586 INFO L225 Difference]: With dead ends: 345 [2019-10-06 23:44:59,586 INFO L226 Difference]: Without dead ends: 237 [2019-10-06 23:44:59,592 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:44:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-06 23:44:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2019-10-06 23:44:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-06 23:44:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 238 transitions. [2019-10-06 23:44:59,615 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 238 transitions. Word has length 166 [2019-10-06 23:44:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:59,616 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 238 transitions. [2019-10-06 23:44:59,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:44:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 238 transitions. [2019-10-06 23:44:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-06 23:44:59,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:59,619 INFO L385 BasicCegarLoop]: trace histogram [114, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:59,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:59,825 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash -774240728, now seen corresponding path program 8 times [2019-10-06 23:44:59,826 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:59,826 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:59,826 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:59,827 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:45:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:45:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7050 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-10-06 23:45:04,961 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:45:04,961 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:45:04,961 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 [2019-10-06 23:46:07,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:46:07,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:46:07,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-06 23:46:07,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:46:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7050 backedges. 124 proven. 55 refuted. 0 times theorem prover too weak. 6871 trivial. 0 not checked. [2019-10-06 23:46:08,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:46:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7050 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 6985 trivial. 0 not checked. [2019-10-06 23:46:09,262 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:46:09,263 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:46:09,263 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:46:09,264 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:46:09,264 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:46:09,264 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:46:09,284 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:46:11,104 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:46:11,109 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:46:11,111 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:46:11,111 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:46:11,111 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_8|) |v_main_~#a0~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:11,111 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_8|) |v_main_~#a0~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))))) (<= __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-06 23:46:11,111 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:46:11,112 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,112 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:46:11,112 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:11,112 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,112 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,113 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_8|) |v_main_~#a0~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))))) (<= __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-06 23:46:11,113 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-06 23:46:11,113 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-06 23:46:11,113 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,113 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:46:11,113 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:11,113 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((|v_main_~#a0~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_8|) |v_main_~#a0~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))))) [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,114 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:11,995 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:46:11,996 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 15, 13, 11] total 151 [2019-10-06 23:46:11,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-10-06 23:46:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-10-06 23:46:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7231, Invalid=15419, Unknown=0, NotChecked=0, Total=22650 [2019-10-06 23:46:12,000 INFO L87 Difference]: Start difference. First operand 228 states and 238 transitions. Second operand 151 states. [2019-10-06 23:46:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:46:29,123 INFO L93 Difference]: Finished difference Result 454 states and 582 transitions. [2019-10-06 23:46:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-10-06 23:46:29,124 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 224 [2019-10-06 23:46:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:46:29,129 INFO L225 Difference]: With dead ends: 454 [2019-10-06 23:46:29,129 INFO L226 Difference]: Without dead ends: 346 [2019-10-06 23:46:29,133 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17945 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=21792, Invalid=66120, Unknown=0, NotChecked=0, Total=87912 [2019-10-06 23:46:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-06 23:46:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 337. [2019-10-06 23:46:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-06 23:46:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 347 transitions. [2019-10-06 23:46:29,177 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 347 transitions. Word has length 224 [2019-10-06 23:46:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:46:29,178 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 347 transitions. [2019-10-06 23:46:29,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-10-06 23:46:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 347 transitions. [2019-10-06 23:46:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-06 23:46:29,188 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:46:29,189 INFO L385 BasicCegarLoop]: trace histogram [115, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:46:29,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:46:29,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:46:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:46:29,403 INFO L82 PathProgramCache]: Analyzing trace with hash 126506119, now seen corresponding path program 9 times [2019-10-06 23:46:29,403 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:46:29,403 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:46:29,403 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:29,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:46:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:46:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:46:35,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:46:35,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:46:35,079 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:46:35,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:46:35,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:46:35,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:46:35,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:46:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:46:35,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:46:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:46:50,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:46:50,344 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:46:50,344 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:46:50,344 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:46:50,345 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:46:50,345 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:46:50,358 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:46:52,093 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:46:52,098 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:46:52,100 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:46:52,100 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:46:52,100 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_9|) |v_main_~#a0~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:52,101 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_9|) |v_main_~#a0~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= __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-06 23:46:52,101 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:46:52,101 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,101 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:46:52,101 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:52,102 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,102 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,102 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (exists ((|v_main_~#a0~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_9|) |v_main_~#a0~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= __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-06 23:46:52,102 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-06 23:46:52,102 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-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:46:52,103 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,104 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((|v_main_~#a0~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_9|) |v_main_~#a0~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) [2019-10-06 23:46:52,104 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,104 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,104 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:52,959 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:46:52,959 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:46:52,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:46:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:46:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:46:52,965 INFO L87 Difference]: Start difference. First operand 337 states and 347 transitions. Second operand 245 states. [2019-10-06 23:47:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:47:28,249 INFO L93 Difference]: Finished difference Result 679 states and 815 transitions. [2019-10-06 23:47:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:47:28,250 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 333 [2019-10-06 23:47:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:47:28,253 INFO L225 Difference]: With dead ends: 679 [2019-10-06 23:47:28,253 INFO L226 Difference]: Without dead ends: 463 [2019-10-06 23:47:28,259 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:47:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-06 23:47:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 454. [2019-10-06 23:47:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-06 23:47:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 464 transitions. [2019-10-06 23:47:28,286 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 464 transitions. Word has length 333 [2019-10-06 23:47:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:47:28,286 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 464 transitions. [2019-10-06 23:47:28,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:47:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 464 transitions. [2019-10-06 23:47:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-10-06 23:47:28,295 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:47:28,295 INFO L385 BasicCegarLoop]: trace histogram [232, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:47:28,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:47:28,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:47:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:47:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash 376483080, now seen corresponding path program 10 times [2019-10-06 23:47:28,502 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:47:28,503 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:47:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:47:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:47:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:47:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:47:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29305 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:47:48,628 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:47:48,628 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:47:48,628 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:47:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:47:49,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 2318 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:47:49,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:47:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 29305 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:47:49,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 29305 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:48:49,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:49,001 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:48:49,001 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:49,002 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:49,002 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:49,002 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:49,039 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:50,386 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:48:50,807 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:48:50,812 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:50,814 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:50,815 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:50,815 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 475#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a0~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_10|) |v_main_~#a0~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:50,815 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 480#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a0~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_10|) |v_main_~#a0~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (<= __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-06 23:48:50,815 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,815 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 489#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:50,816 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 68#true [2019-10-06 23:48:50,816 INFO L193 IcfgInterpreter]: Reachable states at location L48-3 satisfy 460#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:48:50,816 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,816 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,816 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 485#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a0~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_10|) |v_main_~#a0~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) (<= __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-06 23:48:50,816 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-06 23:48:50,817 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-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 494#(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-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location L49 satisfy 465#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:50,817 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,818 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a0~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_10|) |v_main_~#a0~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|))))) [2019-10-06 23:48:50,818 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 455#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,818 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:50,818 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:48:52,345 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:52,346 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:48:52,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:48:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:48:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:48:52,367 INFO L87 Difference]: Start difference. First operand 454 states and 464 transitions. Second operand 479 states. [2019-10-06 23:51:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:51:07,934 INFO L93 Difference]: Finished difference Result 913 states and 1166 transitions. [2019-10-06 23:51:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:51:07,934 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 450 [2019-10-06 23:51:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:51:07,939 INFO L225 Difference]: With dead ends: 913 [2019-10-06 23:51:07,939 INFO L226 Difference]: Without dead ends: 697 [2019-10-06 23:51:07,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2058 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 203.6s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:51:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-06 23:51:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 688. [2019-10-06 23:51:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-06 23:51:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 698 transitions. [2019-10-06 23:51:08,006 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 698 transitions. Word has length 450 [2019-10-06 23:51:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:51:08,006 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 698 transitions. [2019-10-06 23:51:08,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:51:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 698 transitions. [2019-10-06 23:51:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-10-06 23:51:08,012 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:51:08,013 INFO L385 BasicCegarLoop]: trace histogram [466, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:51:08,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:51:08,218 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:51:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:51:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2030910056, now seen corresponding path program 11 times [2019-10-06 23:51:08,219 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:51:08,219 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:51:08,219 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:51:08,220 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:51:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:51:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:52:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 111088 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-10-06 23:52:27,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:52:27,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:52:27,475 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true