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/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:46,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:46,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:46,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:46,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:46,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:46,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:46,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:46,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:46,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:46,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:46,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:46,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:46,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:46,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:46,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:46,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:46,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:46,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:46,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:46,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:46,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:46,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:46,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:46,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:46,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:46,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:46,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:46,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:46,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:46,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:46,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:46,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:46,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:46,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:46,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:46,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:46,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:46,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:46,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:46,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:46,563 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-13 21:32:46,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:46,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:46,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:46,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:46,585 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:46,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:46,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:46,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:46,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:46,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:46,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:46,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:46,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:46,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:46,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:46,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:46,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:46,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:46,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:46,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:46,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:46,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:46,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:46,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:46,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:46,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:46,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:46,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:46,591 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-13 21:32:46,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:46,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:46,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:46,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:46,894 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:46,895 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-13 21:32:46,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c47ebf2/e1a327c22aa04dc8b4b1b16602df8146/FLAGd4c9e9808 [2019-10-13 21:32:47,393 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:47,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-13 21:32:47,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c47ebf2/e1a327c22aa04dc8b4b1b16602df8146/FLAGd4c9e9808 [2019-10-13 21:32:47,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c47ebf2/e1a327c22aa04dc8b4b1b16602df8146 [2019-10-13 21:32:47,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:47,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:47,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:47,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:47,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:47,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:47" (1/1) ... [2019-10-13 21:32:47,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54268d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:47, skipping insertion in model container [2019-10-13 21:32:47,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:47" (1/1) ... [2019-10-13 21:32:47,795 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:47,812 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:47,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:47,982 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:48,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:48,127 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:48,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48 WrapperNode [2019-10-13 21:32:48,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:48,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:48,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:48,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:48,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (1/1) ... [2019-10-13 21:32:48,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:48,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:48,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:48,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:48,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (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-13 21:32:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:48,758 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:48,758 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-13 21:32:48,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:48 BoogieIcfgContainer [2019-10-13 21:32:48,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:48,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:48,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:48,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:48,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:47" (1/3) ... [2019-10-13 21:32:48,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146feb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:48, skipping insertion in model container [2019-10-13 21:32:48,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:48" (2/3) ... [2019-10-13 21:32:48,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146feb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:48, skipping insertion in model container [2019-10-13 21:32:48,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:48" (3/3) ... [2019-10-13 21:32:48,767 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2019-10-13 21:32:48,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:48,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:48,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:48,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:48,821 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:48,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:48,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:48,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:48,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:48,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:48,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-13 21:32:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:48,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:48,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:48,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1973278226, now seen corresponding path program 1 times [2019-10-13 21:32:48,866 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:48,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078130555] [2019-10-13 21:32:48,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,020 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-13 21:32:49,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078130555] [2019-10-13 21:32:49,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:49,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:49,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650256070] [2019-10-13 21:32:49,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:49,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:49,047 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-13 21:32:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:49,087 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2019-10-13 21:32:49,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:49,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:49,100 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:32:49,101 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 21:32:49,105 INFO L600 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-13 21:32:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 21:32:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 21:32:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:32:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-13 21:32:49,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 13 [2019-10-13 21:32:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:49,155 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-13 21:32:49,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-10-13 21:32:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:49,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:49,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:49,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1107315554, now seen corresponding path program 1 times [2019-10-13 21:32:49,158 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:49,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39649067] [2019-10-13 21:32:49,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:49,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39649067] [2019-10-13 21:32:49,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:49,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:49,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745971670] [2019-10-13 21:32:49,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:49,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:49,240 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2019-10-13 21:32:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:49,306 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-13 21:32:49,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:49,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:49,309 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:32:49,309 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:32:49,310 INFO L600 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-13 21:32:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:32:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-13 21:32:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 21:32:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-13 21:32:49,329 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2019-10-13 21:32:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:49,330 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-13 21:32:49,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-13 21:32:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:32:49,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:49,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:49,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1470921508, now seen corresponding path program 1 times [2019-10-13 21:32:49,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:49,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231278137] [2019-10-13 21:32:49,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,437 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-13 21:32:49,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231278137] [2019-10-13 21:32:49,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:49,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:49,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724096063] [2019-10-13 21:32:49,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:49,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:49,440 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2019-10-13 21:32:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:49,630 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-10-13 21:32:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:32:49,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:32:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:49,634 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:32:49,635 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:32:49,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:32:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-10-13 21:32:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 21:32:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-10-13 21:32:49,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 15 [2019-10-13 21:32:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:49,651 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-10-13 21:32:49,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-10-13 21:32:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:32:49,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:49,654 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:49,654 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash -171915918, now seen corresponding path program 1 times [2019-10-13 21:32:49,655 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:49,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112213758] [2019-10-13 21:32:49,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,748 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-13 21:32:49,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112213758] [2019-10-13 21:32:49,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:49,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:49,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152214852] [2019-10-13 21:32:49,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:49,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:49,751 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2019-10-13 21:32:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:49,809 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2019-10-13 21:32:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:49,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:32:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:49,812 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:32:49,812 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:32:49,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:32:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-13 21:32:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:32:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-10-13 21:32:49,819 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 15 [2019-10-13 21:32:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:49,819 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-13 21:32:49,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-10-13 21:32:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:32:49,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:49,820 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:49,821 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1528376143, now seen corresponding path program 1 times [2019-10-13 21:32:49,821 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:49,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423776226] [2019-10-13 21:32:49,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:49,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:49,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423776226] [2019-10-13 21:32:49,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138956669] [2019-10-13 21:32:49,880 INFO L94 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-13 21:32:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:49,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:49,978 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:50,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169059539] [2019-10-13 21:32:50,037 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:50,038 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:50,043 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:50,050 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:50,051 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:50,175 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:50,535 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-13 21:32:50,550 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:50,558 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:50,558 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:50,558 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 135#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:50,559 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 117#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:50,559 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 140#false [2019-10-13 21:32:50,559 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 149#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:50,560 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:32:50,560 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 125#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:50,561 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-13 21:32:50,561 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-13 21:32:50,561 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 154#(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-13 21:32:50,561 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:50,562 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:50,562 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:32:50,562 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:32:50,563 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 130#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:50,563 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 145#false [2019-10-13 21:32:50,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:50,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 4, 4] total 18 [2019-10-13 21:32:50,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211761198] [2019-10-13 21:32:50,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:32:50,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:32:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:32:50,907 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 11 states. [2019-10-13 21:32:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,284 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2019-10-13 21:32:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:32:51,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-10-13 21:32:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,286 INFO L225 Difference]: With dead ends: 63 [2019-10-13 21:32:51,286 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:32:51,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:32:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:32:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-10-13 21:32:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 21:32:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2019-10-13 21:32:51,303 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 16 [2019-10-13 21:32:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,303 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-10-13 21:32:51,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:32:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2019-10-13 21:32:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:32:51,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,306 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2138333176, now seen corresponding path program 1 times [2019-10-13 21:32:51,518 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006770503] [2019-10-13 21:32:51,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:51,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006770503] [2019-10-13 21:32:51,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770572041] [2019-10-13 21:32:51,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 21:32:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:51,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:51,671 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-13 21:32:51,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:51,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509722859] [2019-10-13 21:32:51,706 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:32:51,706 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:51,706 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:51,707 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:51,707 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:51,749 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,131 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:52,165 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,171 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,172 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,172 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:52,172 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-13 21:32:52,173 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,173 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:52,173 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:52,174 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:52,174 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:32:52,177 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:52,177 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-13 21:32:52,178 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-13 21:32:52,178 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:32:52,178 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:52,179 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,179 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:32:52,179 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:32:52,179 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:32:52,180 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:52,180 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,698 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:52,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 14] total 22 [2019-10-13 21:32:52,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399250018] [2019-10-13 21:32:52,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:32:52,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:52,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:32:52,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:32:52,701 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 22 states. [2019-10-13 21:32:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:53,952 INFO L93 Difference]: Finished difference Result 112 states and 162 transitions. [2019-10-13 21:32:53,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:32:53,953 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-10-13 21:32:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:53,954 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:32:53,954 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:32:53,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:32:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:32:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2019-10-13 21:32:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:32:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-13 21:32:53,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 23 [2019-10-13 21:32:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:53,967 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-13 21:32:53,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:32:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-13 21:32:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:32:53,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:53,969 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:54,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:54,172 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash 17647327, now seen corresponding path program 2 times [2019-10-13 21:32:54,173 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:54,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017618746] [2019-10-13 21:32:54,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:54,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:32:54,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017618746] [2019-10-13 21:32:54,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056099611] [2019-10-13 21:32:54,272 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:32:54,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:32:54,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:54,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:32:54,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:32:54,383 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:32:54,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2024490093] [2019-10-13 21:32:54,434 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:32:54,434 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:54,436 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:54,436 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:54,436 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:54,463 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:54,726 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:54,743 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:54,746 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:54,747 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:54,747 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:54,749 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-13 21:32:54,749 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:54,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:54,750 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:54,750 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:54,750 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:32:54,750 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:54,750 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-13 21:32:54,751 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-13 21:32:54,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:32:54,751 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:54,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:54,752 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:32:54,752 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:32:54,752 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:54,752 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:54,753 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:55,429 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:55,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 14] total 27 [2019-10-13 21:32:55,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155414815] [2019-10-13 21:32:55,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 21:32:55,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 21:32:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:32:55,438 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 27 states. [2019-10-13 21:32:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:56,426 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2019-10-13 21:32:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:32:56,426 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-10-13 21:32:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:56,428 INFO L225 Difference]: With dead ends: 92 [2019-10-13 21:32:56,428 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 21:32:56,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=421, Invalid=1931, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:32:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 21:32:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-10-13 21:32:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:32:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-10-13 21:32:56,440 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 27 [2019-10-13 21:32:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:56,440 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-10-13 21:32:56,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 21:32:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-10-13 21:32:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:32:56,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:56,442 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:56,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:56,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash 534790175, now seen corresponding path program 3 times [2019-10-13 21:32:56,647 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:56,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750764613] [2019-10-13 21:32:56,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:56,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:32:56,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750764613] [2019-10-13 21:32:56,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757418350] [2019-10-13 21:32:56,714 INFO L92 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 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-13 21:32:56,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:56,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:56,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:56,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:32:56,827 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:32:56,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1613792322] [2019-10-13 21:32:56,883 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:32:56,883 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:56,884 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:56,884 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:56,884 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:56,910 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:57,077 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:57,091 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:57,094 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:57,094 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:57,095 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:57,095 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-13 21:32:57,095 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:57,095 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:57,096 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:57,096 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:32:57,096 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:57,096 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-13 21:32:57,096 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-13 21:32:57,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:32:57,097 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:57,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:57,097 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:32:57,097 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:32:57,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:57,098 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:57,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:57,553 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:57,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 14] total 26 [2019-10-13 21:32:57,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933409078] [2019-10-13 21:32:57,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 21:32:57,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 21:32:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2019-10-13 21:32:57,555 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 26 states. [2019-10-13 21:32:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:58,404 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-13 21:32:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:32:58,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-10-13 21:32:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:58,405 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:32:58,405 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 21:32:58,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:32:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 21:32:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-13 21:32:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:32:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-10-13 21:32:58,416 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 31 [2019-10-13 21:32:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:58,416 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-10-13 21:32:58,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 21:32:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-10-13 21:32:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:32:58,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:58,418 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:58,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:58,626 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1692693663, now seen corresponding path program 4 times [2019-10-13 21:32:58,627 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:58,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790546001] [2019-10-13 21:32:58,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:32:58,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790546001] [2019-10-13 21:32:58,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924626410] [2019-10-13 21:32:58,730 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-13 21:32:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:58,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:58,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:32:58,844 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:32:59,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344421550] [2019-10-13 21:32:59,114 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:32:59,117 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:59,117 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:59,118 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:59,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:59,141 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:59,312 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:59,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:59,330 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:59,330 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:59,330 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:59,331 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-13 21:32:59,331 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:59,331 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:59,331 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:59,331 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:59,332 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:32:59,332 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:59,332 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-13 21:32:59,332 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-13 21:32:59,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:59,333 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:32:59,334 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:59,822 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:59,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 14] total 38 [2019-10-13 21:32:59,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553061439] [2019-10-13 21:32:59,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-13 21:32:59,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-13 21:32:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1063, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 21:32:59,825 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 38 states. [2019-10-13 21:33:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:01,152 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2019-10-13 21:33:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:33:01,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-10-13 21:33:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:01,154 INFO L225 Difference]: With dead ends: 117 [2019-10-13 21:33:01,154 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 21:33:01,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2019-10-13 21:33:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 21:33:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-13 21:33:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:33:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-10-13 21:33:01,172 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 37 [2019-10-13 21:33:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:01,174 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-10-13 21:33:01,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-13 21:33:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-10-13 21:33:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:33:01,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:01,178 INFO L380 BasicCegarLoop]: trace histogram [22, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:01,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:01,383 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -873939553, now seen corresponding path program 5 times [2019-10-13 21:33:01,385 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:01,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270403577] [2019-10-13 21:33:01,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:01,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:01,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:33:01,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270403577] [2019-10-13 21:33:01,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572146981] [2019-10-13 21:33:01,704 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:33:01,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:01,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:01,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:33:01,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-10-13 21:33:01,930 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:33:02,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1614526941] [2019-10-13 21:33:02,112 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:02,112 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:02,113 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:02,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:02,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:02,128 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:02,290 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:33:02,307 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:02,310 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:02,311 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:02,311 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:33:02,311 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-13 21:33:02,311 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,311 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:02,312 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:02,312 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:02,312 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:33:02,312 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:02,312 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-13 21:33:02,313 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-13 21:33:02,313 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:33:02,313 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:02,313 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:02,313 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:33:02,318 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:02,318 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:33:02,320 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:02,320 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:02,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 10, 14] total 54 [2019-10-13 21:33:02,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035012166] [2019-10-13 21:33:02,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-13 21:33:02,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-13 21:33:02,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2019-10-13 21:33:02,961 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 54 states. [2019-10-13 21:33:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:06,050 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2019-10-13 21:33:06,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-13 21:33:06,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 49 [2019-10-13 21:33:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:06,052 INFO L225 Difference]: With dead ends: 138 [2019-10-13 21:33:06,052 INFO L226 Difference]: Without dead ends: 94 [2019-10-13 21:33:06,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1811, Invalid=10399, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-13 21:33:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-10-13 21:33:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 21:33:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-10-13 21:33:06,067 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 49 [2019-10-13 21:33:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:06,068 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-10-13 21:33:06,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-13 21:33:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-10-13 21:33:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:33:06,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:06,069 INFO L380 BasicCegarLoop]: trace histogram [23, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:06,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:06,273 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1343976277, now seen corresponding path program 6 times [2019-10-13 21:33:06,274 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:06,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493290041] [2019-10-13 21:33:06,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:06,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:06,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-13 21:33:06,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493290041] [2019-10-13 21:33:06,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544198651] [2019-10-13 21:33:06,648 INFO L92 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 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-13 21:33:06,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:06,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:06,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:33:06,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-13 21:33:06,827 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-13 21:33:07,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1491502656] [2019-10-13 21:33:07,515 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:07,515 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:07,515 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:07,516 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:07,516 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:07,547 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:07,704 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:33:07,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:07,722 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:07,722 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:07,723 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:33:07,723 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-13 21:33:07,723 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:07,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:07,723 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:07,724 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:07,724 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:33:07,724 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:07,724 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-13 21:33:07,724 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-13 21:33:07,724 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:33:07,725 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:07,726 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,289 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:08,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 14] total 64 [2019-10-13 21:33:08,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045339242] [2019-10-13 21:33:08,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-13 21:33:08,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-13 21:33:08,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1318, Invalid=2714, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:33:08,293 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 64 states. [2019-10-13 21:33:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:10,958 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2019-10-13 21:33:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-13 21:33:10,959 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 58 [2019-10-13 21:33:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:10,960 INFO L225 Difference]: With dead ends: 167 [2019-10-13 21:33:10,960 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 21:33:10,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3866, Invalid=11140, Unknown=0, NotChecked=0, Total=15006 [2019-10-13 21:33:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 21:33:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-10-13 21:33:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 21:33:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-10-13 21:33:10,977 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 58 [2019-10-13 21:33:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:10,977 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-10-13 21:33:10,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-13 21:33:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-10-13 21:33:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:33:10,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:10,979 INFO L380 BasicCegarLoop]: trace histogram [48, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:11,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:11,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1354658719, now seen corresponding path program 7 times [2019-10-13 21:33:11,191 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:11,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607583165] [2019-10-13 21:33:11,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 2 proven. 1176 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-13 21:33:12,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607583165] [2019-10-13 21:33:12,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246078386] [2019-10-13 21:33:12,373 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-13 21:33:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:12,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:33:12,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-13 21:33:12,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 2 proven. 1176 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-13 21:33:15,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649333788] [2019-10-13 21:33:15,973 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:15,974 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:15,974 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:15,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:15,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:15,995 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:16,137 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:33:16,149 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:16,152 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:16,152 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:16,152 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:33:16,152 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-13 21:33:16,152 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:16,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:16,153 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:16,153 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:16,153 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-13 21:33:16,153 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:16,153 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-13 21:33:16,153 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-13 21:33:16,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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-13 21:33:16,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:16,154 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-13 21:33:16,154 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-13 21:33:16,154 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:16,155 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:33:16,155 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:33:16,155 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:16,902 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:16,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 14] total 114 [2019-10-13 21:33:16,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942034068] [2019-10-13 21:33:16,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-10-13 21:33:16,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-10-13 21:33:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5093, Invalid=7789, Unknown=0, NotChecked=0, Total=12882 [2019-10-13 21:33:16,909 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 114 states. [2019-10-13 21:33:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:24,272 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2019-10-13 21:33:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-13 21:33:24,272 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 83 [2019-10-13 21:33:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:24,274 INFO L225 Difference]: With dead ends: 217 [2019-10-13 21:33:24,274 INFO L226 Difference]: Without dead ends: 161 [2019-10-13 21:33:24,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10802 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15091, Invalid=34415, Unknown=0, NotChecked=0, Total=49506 [2019-10-13 21:33:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-13 21:33:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-13 21:33:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-13 21:33:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2019-10-13 21:33:24,293 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 83 [2019-10-13 21:33:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:24,294 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2019-10-13 21:33:24,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-10-13 21:33:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2019-10-13 21:33:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:33:24,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:24,296 INFO L380 BasicCegarLoop]: trace histogram [98, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:24,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:24,500 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1606633759, now seen corresponding path program 8 times [2019-10-13 21:33:24,501 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:24,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830336921] [2019-10-13 21:33:24,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:24,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat