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_copy5_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:31:31,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:31:31,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:31:31,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:31:31,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:31:31,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:31:31,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:31:31,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:31:31,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:31:31,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:31:31,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:31:31,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:31:31,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:31:31,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:31:31,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:31:31,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:31:31,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:31:31,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:31:31,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:31:31,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:31:31,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:31:31,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:31:31,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:31:31,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:31:31,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:31:31,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:31:31,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:31:31,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:31:31,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:31:31,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:31:31,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:31:31,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:31:31,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:31:31,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:31:31,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:31:31,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:31:31,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:31:31,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:31:31,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:31:31,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:31:31,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:31:31,625 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:31:31,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:31:31,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:31:31,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:31:31,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:31:31,659 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:31:31,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:31:31,659 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:31:31,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:31:31,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:31:31,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:31:31,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:31:31,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:31:31,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:31:31,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:31:31,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:31:31,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:31:31,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:31:31,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:31:31,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:31:31,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:31:31,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:31:31,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:31,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:31:31,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:31:31,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:31:31,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:31:31,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:31:31,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:31:31,669 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:31:31,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:31:31,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:31:31,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:31:31,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:31:31,945 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:31:31,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_ground-1.i [2019-10-06 23:31:32,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d327e4a5/e869a75893e54443b9609e61707b1fff/FLAG66eccebf0 [2019-10-06 23:31:32,451 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:31:32,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_ground-1.i [2019-10-06 23:31:32,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d327e4a5/e869a75893e54443b9609e61707b1fff/FLAG66eccebf0 [2019-10-06 23:31:32,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d327e4a5/e869a75893e54443b9609e61707b1fff [2019-10-06 23:31:32,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:31:32,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:31:32,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:32,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:31:32,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:31:32,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:32" (1/1) ... [2019-10-06 23:31:32,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2e6592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:32, skipping insertion in model container [2019-10-06 23:31:32,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:32" (1/1) ... [2019-10-06 23:31:32,883 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:31:32,904 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:31:33,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:33,085 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:31:33,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:33,146 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:31:33,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33 WrapperNode [2019-10-06 23:31:33,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:33,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:31:33,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:31:33,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:31:33,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (1/1) ... [2019-10-06 23:31:33,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:31:33,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:31:33,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:31:33,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:31:33,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (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:31:33,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:31:33,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:31:33,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:31:33,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:31:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:31:33,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:31:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:31:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:31:33,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:31:33,813 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:31:33,814 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-06 23:31:33,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:33 BoogieIcfgContainer [2019-10-06 23:31:33,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:31:33,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:31:33,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:31:33,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:31:33,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:31:32" (1/3) ... [2019-10-06 23:31:33,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2995d675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:33, skipping insertion in model container [2019-10-06 23:31:33,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:33" (2/3) ... [2019-10-06 23:31:33,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2995d675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:33, skipping insertion in model container [2019-10-06 23:31:33,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:33" (3/3) ... [2019-10-06 23:31:33,823 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy5_ground-1.i [2019-10-06 23:31:33,831 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:31:33,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:31:33,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:31:33,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:31:33,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:31:33,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:31:33,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:31:33,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:31:33,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:31:33,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:31:33,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:31:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:31:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:31:33,892 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:33,892 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:33,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -324339811, now seen corresponding path program 1 times [2019-10-06 23:31:33,906 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:33,906 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:33,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:33,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:34,087 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:31:34,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:34,089 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:34,089 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:34,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:34,107 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-06 23:31:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:34,145 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-06 23:31:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:34,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:31:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:34,159 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:31:34,159 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:31:34,165 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:31:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:31:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:31:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:31:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-06 23:31:34,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2019-10-06 23:31:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:34,203 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-06 23:31:34,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-10-06 23:31:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:31:34,205 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:34,205 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:34,205 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1265549521, now seen corresponding path program 1 times [2019-10-06 23:31:34,206 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:34,206 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:34,207 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:34,207 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:34,291 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:31:34,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:34,293 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:34,293 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:34,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:34,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:34,295 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2019-10-06 23:31:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:34,339 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-10-06 23:31:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:34,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-06 23:31:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:34,341 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:31:34,341 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:31:34,342 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:31:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:31:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:31:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:31:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-06 23:31:34,349 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-10-06 23:31:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:34,350 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-06 23:31:34,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-06 23:31:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-06 23:31:34,351 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:34,351 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] [2019-10-06 23:31:34,351 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2130465201, now seen corresponding path program 1 times [2019-10-06 23:31:34,352 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:34,352 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:34,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:34,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:31:34,450 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:34,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:34,451 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:31:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:34,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:31:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:31:34,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:31:34,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:34,658 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:34,659 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:34,669 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:34,677 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:34,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:34,870 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:36,297 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:36,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:36,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:36,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:36,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((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_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:36,340 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:36,340 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:36,340 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((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_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:36,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:36,341 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:36,341 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:36,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((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_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:36,343 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:36,343 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:31:36,344 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:31:36,345 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:36,345 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:36,346 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:36,346 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:36,346 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((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_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:31:36,347 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:36,663 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:36,664 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:31:36,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:31:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:31:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:31:36,673 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 17 states. [2019-10-06 23:31:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:37,240 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2019-10-06 23:31:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:31:37,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-10-06 23:31:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:37,242 INFO L225 Difference]: With dead ends: 57 [2019-10-06 23:31:37,242 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:31:37,245 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 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:31:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:31:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2019-10-06 23:31:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-06 23:31:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-10-06 23:31:37,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2019-10-06 23:31:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:37,259 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-10-06 23:31:37,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:31:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-10-06 23:31:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:31:37,260 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:37,260 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] [2019-10-06 23:31:37,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:37,462 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1324055007, now seen corresponding path program 2 times [2019-10-06 23:31:37,463 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:37,463 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:37,463 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:37,464 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-06 23:31:37,530 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:37,530 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:37,531 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:31:37,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:31:37,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:37,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:31:37,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-06 23:31:37,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-06 23:31:37,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:37,626 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:37,626 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:37,626 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:37,627 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:37,627 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:37,661 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:38,766 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:38,775 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:38,782 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:38,783 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:38,783 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:38,783 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,783 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:38,784 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 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:31:38,784 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:38,784 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,784 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 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:31:38,785 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,785 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,785 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:31:38,786 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:31:38,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:38,788 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:38,788 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:38,789 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,789 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:31:38,789 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:39,040 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:39,040 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:31:39,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:31:39,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:31:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:31:39,042 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 17 states. [2019-10-06 23:31:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:39,672 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2019-10-06 23:31:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:31:39,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-10-06 23:31:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:39,674 INFO L225 Difference]: With dead ends: 70 [2019-10-06 23:31:39,674 INFO L226 Difference]: Without dead ends: 53 [2019-10-06 23:31:39,675 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:31:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-06 23:31:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-06 23:31:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:31:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-06 23:31:39,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 25 [2019-10-06 23:31:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:39,685 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-06 23:31:39,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:31:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-06 23:31:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:31:39,687 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:39,687 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:39,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:39,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -834478947, now seen corresponding path program 3 times [2019-10-06 23:31:39,893 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:39,893 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:39,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:39,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-06 23:31:40,016 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:40,016 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:40,017 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:31:40,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:40,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:40,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:31:40,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-06 23:31:40,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-06 23:31:40,240 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:40,242 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:40,242 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:40,242 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:40,243 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:40,243 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:40,263 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:41,215 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:41,224 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:41,227 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:41,227 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:41,228 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(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_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (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)))) (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_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:41,228 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:41,228 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:41,228 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (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)))) (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_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:41,229 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:41,229 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:41,229 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (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)))) (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_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:41,229 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:41,229 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:41,230 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:31:41,230 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:31:41,230 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:41,230 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:41,230 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:41,231 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:41,231 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (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)))) (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_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) [2019-10-06 23:31:41,231 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:41,535 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:41,535 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 27 [2019-10-06 23:31:41,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:31:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:31:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:31:41,538 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 27 states. [2019-10-06 23:31:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:42,584 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2019-10-06 23:31:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-06 23:31:42,585 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2019-10-06 23:31:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:42,586 INFO L225 Difference]: With dead ends: 98 [2019-10-06 23:31:42,586 INFO L226 Difference]: Without dead ends: 64 [2019-10-06 23:31:42,587 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=2003, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:31:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-06 23:31:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-06 23:31:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:31:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-10-06 23:31:42,598 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 40 [2019-10-06 23:31:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:42,598 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-10-06 23:31:42,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:31:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-10-06 23:31:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-06 23:31:42,600 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:42,600 INFO L385 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:42,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:42,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1597607905, now seen corresponding path program 4 times [2019-10-06 23:31:42,814 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:42,814 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:42,814 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:42,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:31:43,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:43,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:43,007 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:31:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:43,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:31:43,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:31:43,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:31:43,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:43,344 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:43,344 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:43,344 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:43,344 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:43,345 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:43,366 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:44,060 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:44,260 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:44,486 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:44,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:44,501 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:44,501 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:44,502 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~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:31:44,502 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:44,502 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:44,502 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(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_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~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:31:44,503 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:44,504 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:44,504 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(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_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~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:31:44,504 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:44,504 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:44,504 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:31:44,505 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:31:44,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:44,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:44,505 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:44,505 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:44,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~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:31:44,506 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:44,817 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:44,817 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-06 23:31:44,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:31:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:31:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:31:44,820 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 35 states. [2019-10-06 23:31:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:45,965 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2019-10-06 23:31:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:31:45,966 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2019-10-06 23:31:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:45,968 INFO L225 Difference]: With dead ends: 115 [2019-10-06 23:31:45,968 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:31:45,970 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:31:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:31:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-10-06 23:31:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-06 23:31:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-06 23:31:45,980 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 51 [2019-10-06 23:31:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:45,981 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-06 23:31:45,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:31:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-06 23:31:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:31:45,983 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:45,983 INFO L385 BasicCegarLoop]: trace histogram [22, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:46,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:46,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash -175873439, now seen corresponding path program 5 times [2019-10-06 23:31:46,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:46,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:46,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:46,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:31:46,559 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:46,560 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:46,560 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:31:47,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:31:47,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:47,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:31:47,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-10-06 23:31:47,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-10-06 23:31:47,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:47,482 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:47,482 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:47,483 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:47,483 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:47,483 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:47,501 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:48,447 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:48,455 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:48,457 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:48,457 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~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|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:48,458 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~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|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,458 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~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|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,459 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:31:48,459 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:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:48,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:48,460 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:48,460 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,460 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~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|)))))) [2019-10-06 23:31:48,460 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:48,853 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:48,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8, 8, 11] total 47 [2019-10-06 23:31:48,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-06 23:31:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-06 23:31:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1743, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:31:48,855 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 47 states. [2019-10-06 23:31:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:51,085 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-10-06 23:31:51,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-06 23:31:51,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 63 [2019-10-06 23:31:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:51,088 INFO L225 Difference]: With dead ends: 151 [2019-10-06 23:31:51,088 INFO L226 Difference]: Without dead ends: 112 [2019-10-06 23:31:51,091 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1275, Invalid=6557, Unknown=0, NotChecked=0, Total=7832 [2019-10-06 23:31:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-06 23:31:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-10-06 23:31:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-06 23:31:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-10-06 23:31:51,105 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 63 [2019-10-06 23:31:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:51,105 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-10-06 23:31:51,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-06 23:31:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-10-06 23:31:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-06 23:31:51,107 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:51,107 INFO L385 BasicCegarLoop]: trace histogram [23, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:51,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:51,313 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1818625809, now seen corresponding path program 6 times [2019-10-06 23:31:51,314 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:51,314 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:51,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:51,315 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:31:51,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:51,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:51,895 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:31:52,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:52,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:52,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:31:52,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:31:52,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:31:52,770 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:52,771 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:31:52,771 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:52,772 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:52,772 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:52,772 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:52,785 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:53,746 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:53,750 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:53,752 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:53,753 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (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_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (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_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:53,753 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:53,754 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (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_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:53,754 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:53,754 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:53,754 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:31:53,754 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:31:53,754 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:31:53,755 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:53,755 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:31:53,755 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:53,755 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (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_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) [2019-10-06 23:31:53,755 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:31:54,120 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:54,120 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-06 23:31:54,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:31:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:31:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:31:54,124 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 61 states. [2019-10-06 23:31:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:56,653 INFO L93 Difference]: Finished difference Result 211 states and 247 transitions. [2019-10-06 23:31:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-06 23:31:56,654 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 99 [2019-10-06 23:31:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:56,656 INFO L225 Difference]: With dead ends: 211 [2019-10-06 23:31:56,656 INFO L226 Difference]: Without dead ends: 137 [2019-10-06 23:31:56,660 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-06 23:31:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-06 23:31:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2019-10-06 23:31:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-06 23:31:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2019-10-06 23:31:56,675 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 99 [2019-10-06 23:31:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:56,675 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2019-10-06 23:31:56,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:31:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2019-10-06 23:31:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-06 23:31:56,677 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:56,678 INFO L385 BasicCegarLoop]: trace histogram [48, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:56,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:56,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash 194043677, now seen corresponding path program 7 times [2019-10-06 23:31:56,883 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:56,883 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:56,883 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:56,884 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:31:57,977 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:57,977 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:57,977 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:31:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:58,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:31:58,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:31:58,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:32:00,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:00,967 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:32:00,968 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:00,968 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:00,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:00,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:00,986 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:01,966 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:01,973 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:01,976 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:01,976 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:01,976 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~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| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:01,977 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,977 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:32:01,977 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~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| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:01,977 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:01,977 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,978 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~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| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:01,978 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,978 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,978 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:32:01,978 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:32:01,978 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:32:01,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:01,979 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:32:01,979 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,979 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~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| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) [2019-10-06 23:32:01,979 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:32:02,468 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:02,469 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-06 23:32:02,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:32:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:32:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:32:02,475 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 111 states. [2019-10-06 23:32:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:09,642 INFO L93 Difference]: Finished difference Result 261 states and 322 transitions. [2019-10-06 23:32:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-06 23:32:09,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 124 [2019-10-06 23:32:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:09,645 INFO L225 Difference]: With dead ends: 261 [2019-10-06 23:32:09,646 INFO L226 Difference]: Without dead ends: 187 [2019-10-06 23:32:09,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-06 23:32:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-06 23:32:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2019-10-06 23:32:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-06 23:32:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2019-10-06 23:32:09,669 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 124 [2019-10-06 23:32:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:09,670 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2019-10-06 23:32:09,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:32:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2019-10-06 23:32:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-06 23:32:09,673 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:09,673 INFO L385 BasicCegarLoop]: trace histogram [98, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:09,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:09,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1481008989, now seen corresponding path program 8 times [2019-10-06 23:32:09,878 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:09,878 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:09,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:09,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5241 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-06 23:32:13,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:13,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:13,613 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:33:10,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-06 23:33:10,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:10,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-06 23:33:10,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5241 backedges. 146 proven. 78 refuted. 0 times theorem prover too weak. 5017 trivial. 0 not checked. [2019-10-06 23:33:11,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5241 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 5163 trivial. 0 not checked. [2019-10-06 23:33:11,803 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:11,804 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:11,805 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:11,805 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:11,805 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:11,805 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:11,822 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:12,709 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:12,722 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:12,724 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:12,724 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:12,724 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_29 Int) (|v_main_~#a6~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) (|v_main_~#a6~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_8|) |v_main_~#a6~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_31) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_29)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:12,724 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_29 Int) (|v_main_~#a6~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) (|v_main_~#a6~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_8|) |v_main_~#a6~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_31) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_29)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_29 Int) (|v_main_~#a6~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) (|v_main_~#a6~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_8|) |v_main_~#a6~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_31) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_29)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:12,725 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:12,726 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:12,726 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:33:12,726 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:33:12,726 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:12,726 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:12,726 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:33:12,727 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:12,727 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_29 Int) (|v_main_~#a6~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) (|v_main_~#a6~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_8|) |v_main_~#a6~0.offset_BEFORE_CALL_8|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_31) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_29)))))) [2019-10-06 23:33:12,727 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:33:13,485 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:13,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 17, 15, 11] total 139 [2019-10-06 23:33:13,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-10-06 23:33:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-10-06 23:33:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5582, Invalid=13600, Unknown=0, NotChecked=0, Total=19182 [2019-10-06 23:33:13,490 INFO L87 Difference]: Start difference. First operand 178 states and 184 transitions. Second operand 139 states. [2019-10-06 23:33:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:26,087 INFO L93 Difference]: Finished difference Result 332 states and 414 transitions. [2019-10-06 23:33:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-10-06 23:33:26,087 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 174 [2019-10-06 23:33:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:26,089 INFO L225 Difference]: With dead ends: 332 [2019-10-06 23:33:26,089 INFO L226 Difference]: Without dead ends: 258 [2019-10-06 23:33:26,092 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16065 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=16871, Invalid=57385, Unknown=0, NotChecked=0, Total=74256 [2019-10-06 23:33:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-06 23:33:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2019-10-06 23:33:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-06 23:33:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 255 transitions. [2019-10-06 23:33:26,115 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 255 transitions. Word has length 174 [2019-10-06 23:33:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:26,116 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 255 transitions. [2019-10-06 23:33:26,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-10-06 23:33:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 255 transitions. [2019-10-06 23:33:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-06 23:33:26,119 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:26,120 INFO L385 BasicCegarLoop]: trace histogram [99, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:26,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:26,321 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1346824111, now seen corresponding path program 9 times [2019-10-06 23:33:26,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:26,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:26,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:26,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6705 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:33:30,246 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:30,246 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:30,246 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:33:30,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:33:30,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:30,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-06 23:33:30,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6705 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:33:30,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6705 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:33:41,368 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:41,369 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:41,369 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:41,370 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:41,370 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:41,370 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:41,388 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:42,196 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:33:42,436 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:42,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:42,450 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:42,451 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:42,451 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_9| Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a6~0.base_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_36) v_prenex_33))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_9|) |v_main_~#a6~0.offset_BEFORE_CALL_9|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:42,451 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:42,451 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:33:42,451 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_9| Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a6~0.base_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_36) v_prenex_33))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_9|) |v_main_~#a6~0.offset_BEFORE_CALL_9|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:42,452 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:42,452 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:42,452 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:42,452 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_9| Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a6~0.base_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_36) v_prenex_33))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_9|) |v_main_~#a6~0.offset_BEFORE_CALL_9|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:42,452 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:42,452 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:33:42,453 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:33:42,453 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:42,453 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:42,453 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:33:42,453 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_9| Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a6~0.base_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_36) v_prenex_33))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a6~0.base_BEFORE_CALL_9|) |v_main_~#a6~0.offset_BEFORE_CALL_9|)))))) [2019-10-06 23:33:42,453 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:42,454 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:33:43,233 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:43,233 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102, 11] total 213 [2019-10-06 23:33:43,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 213 states [2019-10-06 23:33:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2019-10-06 23:33:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20532, Invalid=24624, Unknown=0, NotChecked=0, Total=45156 [2019-10-06 23:33:43,237 INFO L87 Difference]: Start difference. First operand 249 states and 255 transitions. Second operand 213 states. [2019-10-06 23:34:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:34:08,063 INFO L93 Difference]: Finished difference Result 503 states and 615 transitions. [2019-10-06 23:34:08,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-10-06 23:34:08,064 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 245 [2019-10-06 23:34:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:34:08,067 INFO L225 Difference]: With dead ends: 503 [2019-10-06 23:34:08,067 INFO L226 Difference]: Without dead ends: 359 [2019-10-06 23:34:08,071 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31289 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=61187, Invalid=114793, Unknown=0, NotChecked=0, Total=175980 [2019-10-06 23:34:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-10-06 23:34:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2019-10-06 23:34:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-06 23:34:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 356 transitions. [2019-10-06 23:34:08,091 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 356 transitions. Word has length 245 [2019-10-06 23:34:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:34:08,091 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 356 transitions. [2019-10-06 23:34:08,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 213 states. [2019-10-06 23:34:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 356 transitions. [2019-10-06 23:34:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-06 23:34:08,097 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:34:08,098 INFO L385 BasicCegarLoop]: trace histogram [200, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:34:08,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:08,308 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:34:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:34:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1982602275, now seen corresponding path program 10 times [2019-10-06 23:34:08,309 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:34:08,309 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:08,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:08,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:34:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21855 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:34:23,002 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:23,002 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:34:23,005 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:34:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:23,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 202 conjunts are in the unsatisfiable core [2019-10-06 23:34:23,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:34:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21855 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:34:23,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:35:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21855 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:35:06,218 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:35:06,219 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:35:06,219 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:35:06,220 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:35:06,220 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:35:06,220 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:35:06,256 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:35:06,680 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:35:07,247 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:35:07,250 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:35:07,252 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:35:07,252 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:35:07,252 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a6~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_39) (select (select |#memory_int| v_prenex_40) v_prenex_37))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_10|) |v_main_~#a6~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:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 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:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a6~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_39) (select (select |#memory_int| v_prenex_40) v_prenex_37))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_10|) |v_main_~#a6~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:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a6~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_39) (select (select |#memory_int| v_prenex_40) v_prenex_37))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_10|) |v_main_~#a6~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:35:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:07,254 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:35:07,254 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:35:07,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:35:07,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:35:07,254 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(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:35:07,254 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a6~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_39) (select (select |#memory_int| v_prenex_40) v_prenex_37))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_10|) |v_main_~#a6~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:35:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:35:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-06 23:35:08,580 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:35:08,581 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [203, 203, 203, 11] total 415 [2019-10-06 23:35:08,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 415 states [2019-10-06 23:35:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 415 interpolants. [2019-10-06 23:35:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81839, Invalid=89971, Unknown=0, NotChecked=0, Total=171810 [2019-10-06 23:35:08,593 INFO L87 Difference]: Start difference. First operand 350 states and 356 transitions. Second operand 415 states. [2019-10-06 23:36:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:36:40,697 INFO L93 Difference]: Finished difference Result 705 states and 918 transitions. [2019-10-06 23:36:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 414 states. [2019-10-06 23:36:40,697 INFO L78 Accepts]: Start accepts. Automaton has 415 states. Word has length 346 [2019-10-06 23:36:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:36:40,701 INFO L225 Difference]: With dead ends: 705 [2019-10-06 23:36:40,701 INFO L226 Difference]: Without dead ends: 561 [2019-10-06 23:36:40,715 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1650 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113604 ImplicationChecksByTransitivity, 143.8s TimeCoverageRelationStatistics Valid=244704, Invalid=433448, Unknown=0, NotChecked=0, Total=678152 [2019-10-06 23:36:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-06 23:36:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 552. [2019-10-06 23:36:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-06 23:36:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 558 transitions. [2019-10-06 23:36:40,756 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 558 transitions. Word has length 346 [2019-10-06 23:36:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:36:40,756 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 558 transitions. [2019-10-06 23:36:40,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 415 states. [2019-10-06 23:36:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 558 transitions. [2019-10-06 23:36:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-10-06 23:36:40,766 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:36:40,766 INFO L385 BasicCegarLoop]: trace histogram [402, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:36:40,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:40,974 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:36:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:36:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2116827363, now seen corresponding path program 11 times [2019-10-06 23:36:40,975 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:36:40,975 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:36:40,975 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:40,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:36:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 82758 backedges. 0 proven. 81003 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-06 23:37:38,685 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:38,685 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:38,686 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