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 -i ../../../trunk/examples/svcomp/array-tiling/pr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:16,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:16,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:16,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:16,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:16,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:16,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:16,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:16,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:16,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:16,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:16,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:16,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:16,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:16,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:16,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:16,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:16,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:16,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:16,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:16,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:16,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:16,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:16,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:16,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:16,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:16,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:16,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:16,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:16,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:16,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:16,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:16,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:16,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:16,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:16,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:16,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:16,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:16,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:16,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:16,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:16,110 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-14 21:50:16,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:16,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:16,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:16,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:16,126 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:16,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:16,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:16,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:16,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:16,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:16,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:16,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:16,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:16,128 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:16,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:16,128 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:16,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:16,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:16,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:16,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:16,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:16,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:16,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:16,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:16,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:16,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:16,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:16,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:16,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:16,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:16,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:16,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:16,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:16,468 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:16,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr2.c [2019-10-14 21:50:16,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c6011ba/bc1b01f424724b4aa2a042d07337acff/FLAG28de8ef3b [2019-10-14 21:50:16,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:16,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr2.c [2019-10-14 21:50:16,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c6011ba/bc1b01f424724b4aa2a042d07337acff/FLAG28de8ef3b [2019-10-14 21:50:17,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c6011ba/bc1b01f424724b4aa2a042d07337acff [2019-10-14 21:50:17,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:17,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:17,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:17,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:17,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:17,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a57a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17, skipping insertion in model container [2019-10-14 21:50:17,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:17,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:17,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:17,650 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:17,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:17,691 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:17,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17 WrapperNode [2019-10-14 21:50:17,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:17,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:17,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:17,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:17,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (1/1) ... [2019-10-14 21:50:17,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:17,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:17,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:17,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:17,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (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-14 21:50:17,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:17,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:17,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:17,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:18,191 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:18,192 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:18,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:18 BoogieIcfgContainer [2019-10-14 21:50:18,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:18,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:18,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:18,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:18,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:17" (1/3) ... [2019-10-14 21:50:18,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c15dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:18, skipping insertion in model container [2019-10-14 21:50:18,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:17" (2/3) ... [2019-10-14 21:50:18,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c15dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:18, skipping insertion in model container [2019-10-14 21:50:18,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:18" (3/3) ... [2019-10-14 21:50:18,202 INFO L109 eAbstractionObserver]: Analyzing ICFG pr2.c [2019-10-14 21:50:18,220 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:18,229 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:18,240 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:18,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:18,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:18,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:18,262 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:18,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:18,262 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:18,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:18,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-10-14 21:50:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:18,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:18,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:18,286 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash 435909, now seen corresponding path program 1 times [2019-10-14 21:50:18,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:18,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771983630] [2019-10-14 21:50:18,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,556 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-14 21:50:18,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771983630] [2019-10-14 21:50:18,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:18,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:50:18,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200582136] [2019-10-14 21:50:18,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:50:18,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:50:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:18,585 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 6 states. [2019-10-14 21:50:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:18,896 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-10-14 21:50:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:50:18,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:50:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:18,909 INFO L225 Difference]: With dead ends: 54 [2019-10-14 21:50:18,909 INFO L226 Difference]: Without dead ends: 30 [2019-10-14 21:50:18,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:50:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-14 21:50:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-14 21:50:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 21:50:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-14 21:50:18,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-10-14 21:50:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:18,975 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-14 21:50:18,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:50:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-14 21:50:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:18,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:18,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:18,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2282951, now seen corresponding path program 1 times [2019-10-14 21:50:18,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:18,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750424981] [2019-10-14 21:50:18,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:19,107 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-14 21:50:19,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750424981] [2019-10-14 21:50:19,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:19,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:19,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270429815] [2019-10-14 21:50:19,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:19,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:19,112 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-14 21:50:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:19,242 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-10-14 21:50:19,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:19,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:50:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:19,246 INFO L225 Difference]: With dead ends: 50 [2019-10-14 21:50:19,247 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 21:50:19,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 21:50:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-14 21:50:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:50:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:50:19,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 21:50:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:19,257 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:50:19,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:50:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:19,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:19,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:19,259 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1753718226, now seen corresponding path program 1 times [2019-10-14 21:50:19,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:19,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705748114] [2019-10-14 21:50:19,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:19,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:19,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:19,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705748114] [2019-10-14 21:50:19,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228957753] [2019-10-14 21:50:19,667 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-14 21:50:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:19,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 21:50:19,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:19,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:19,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:19,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:19,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:19,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:19,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:19,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 21:50:19,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:19,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:19,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:19,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-14 21:50:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:20,007 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:20,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-14 21:50:20,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215815346] [2019-10-14 21:50:20,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:20,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:20,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:20,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:20,009 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 16 states. [2019-10-14 21:50:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:20,706 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2019-10-14 21:50:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:50:20,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-10-14 21:50:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:20,711 INFO L225 Difference]: With dead ends: 99 [2019-10-14 21:50:20,711 INFO L226 Difference]: Without dead ends: 83 [2019-10-14 21:50:20,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:50:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-14 21:50:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 37. [2019-10-14 21:50:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 21:50:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-14 21:50:20,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2019-10-14 21:50:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:20,730 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-14 21:50:20,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-14 21:50:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:20,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:20,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:20,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:20,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1052653648, now seen corresponding path program 1 times [2019-10-14 21:50:20,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:20,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069656115] [2019-10-14 21:50:20,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:21,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069656115] [2019-10-14 21:50:21,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:21,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:21,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868046354] [2019-10-14 21:50:21,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:21,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:21,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:21,027 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 5 states. [2019-10-14 21:50:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:21,127 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-14 21:50:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:21,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 21:50:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:21,129 INFO L225 Difference]: With dead ends: 64 [2019-10-14 21:50:21,129 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 21:50:21,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 21:50:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-10-14 21:50:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 21:50:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-14 21:50:21,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2019-10-14 21:50:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:21,138 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-14 21:50:21,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-14 21:50:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:21,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:21,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:21,140 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1445680658, now seen corresponding path program 1 times [2019-10-14 21:50:21,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:21,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498581250] [2019-10-14 21:50:21,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:21,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:21,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:21,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498581250] [2019-10-14 21:50:21,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234921725] [2019-10-14 21:50:21,378 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-14 21:50:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:50:21,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:21,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:21,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:21,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-14 21:50:21,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2019-10-14 21:50:21,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:21,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:21,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:21,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2019-10-14 21:50:21,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:21,499 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,514 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.4 percent of original size [2019-10-14 21:50:21,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:38 [2019-10-14 21:50:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:21,589 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:21,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-10-14 21:50:21,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060822820] [2019-10-14 21:50:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 21:50:21,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 21:50:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:50:21,591 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 15 states. [2019-10-14 21:50:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:22,024 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-10-14 21:50:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 21:50:22,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-10-14 21:50:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:22,026 INFO L225 Difference]: With dead ends: 73 [2019-10-14 21:50:22,026 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 21:50:22,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:50:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 21:50:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-10-14 21:50:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 21:50:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-10-14 21:50:22,037 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 20 [2019-10-14 21:50:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:22,037 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-10-14 21:50:22,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 21:50:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-10-14 21:50:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 21:50:22,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:22,040 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:22,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:22,244 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1227860693, now seen corresponding path program 1 times [2019-10-14 21:50:22,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:22,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966095618] [2019-10-14 21:50:22,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:22,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966095618] [2019-10-14 21:50:22,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:22,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:22,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594209182] [2019-10-14 21:50:22,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:22,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:22,318 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 4 states. [2019-10-14 21:50:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:22,412 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2019-10-14 21:50:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:22,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-14 21:50:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:22,414 INFO L225 Difference]: With dead ends: 77 [2019-10-14 21:50:22,414 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 21:50:22,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 21:50:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-10-14 21:50:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 21:50:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-10-14 21:50:22,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 24 [2019-10-14 21:50:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:22,434 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-10-14 21:50:22,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-10-14 21:50:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 21:50:22,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:22,438 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, 1] [2019-10-14 21:50:22,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1764184813, now seen corresponding path program 1 times [2019-10-14 21:50:22,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:22,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767735378] [2019-10-14 21:50:22,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:22,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767735378] [2019-10-14 21:50:22,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:22,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:22,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726651465] [2019-10-14 21:50:22,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:22,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:22,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:22,509 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 4 states. [2019-10-14 21:50:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:22,584 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-10-14 21:50:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:22,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-14 21:50:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:22,586 INFO L225 Difference]: With dead ends: 72 [2019-10-14 21:50:22,586 INFO L226 Difference]: Without dead ends: 51 [2019-10-14 21:50:22,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-14 21:50:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-10-14 21:50:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 21:50:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-14 21:50:22,596 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 24 [2019-10-14 21:50:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:22,597 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-14 21:50:22,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-14 21:50:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 21:50:22,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:22,598 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, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:22,598 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1419737983, now seen corresponding path program 1 times [2019-10-14 21:50:22,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:22,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470740121] [2019-10-14 21:50:22,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:22,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470740121] [2019-10-14 21:50:22,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572608346] [2019-10-14 21:50:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-14 21:50:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:50:22,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:22,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:22,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:22,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:22,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:22,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-14 21:50:22,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:22,891 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:22,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-14 21:50:22,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450998219] [2019-10-14 21:50:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 21:50:22,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 21:50:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:50:22,892 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 15 states. [2019-10-14 21:50:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:23,346 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2019-10-14 21:50:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:50:23,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-14 21:50:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:23,349 INFO L225 Difference]: With dead ends: 99 [2019-10-14 21:50:23,349 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 21:50:23,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 21:50:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2019-10-14 21:50:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-14 21:50:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-10-14 21:50:23,363 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 29 [2019-10-14 21:50:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:23,364 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-14 21:50:23,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 21:50:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-10-14 21:50:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 21:50:23,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:23,365 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, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:23,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:23,567 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash -269205759, now seen corresponding path program 1 times [2019-10-14 21:50:23,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:23,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607286647] [2019-10-14 21:50:23,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:23,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607286647] [2019-10-14 21:50:23,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765979116] [2019-10-14 21:50:23,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:23,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:23,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:23,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-14 21:50:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:23,990 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:23,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-10-14 21:50:23,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642201714] [2019-10-14 21:50:23,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:50:23,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:50:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:50:23,992 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 19 states. [2019-10-14 21:50:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,561 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-10-14 21:50:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:50:24,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-10-14 21:50:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,563 INFO L225 Difference]: With dead ends: 106 [2019-10-14 21:50:24,563 INFO L226 Difference]: Without dead ends: 104 [2019-10-14 21:50:24,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-14 21:50:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2019-10-14 21:50:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-14 21:50:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-10-14 21:50:24,580 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 29 [2019-10-14 21:50:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,580 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-10-14 21:50:24,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:50:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-10-14 21:50:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 21:50:24,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,582 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:24,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -833830662, now seen corresponding path program 1 times [2019-10-14 21:50:24,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652238339] [2019-10-14 21:50:24,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:24,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652238339] [2019-10-14 21:50:24,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:24,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:24,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210511462] [2019-10-14 21:50:24,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:24,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,855 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 4 states. [2019-10-14 21:50:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,925 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-10-14 21:50:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:24,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-14 21:50:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,927 INFO L225 Difference]: With dead ends: 111 [2019-10-14 21:50:24,927 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 21:50:24,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 21:50:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-14 21:50:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-14 21:50:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-10-14 21:50:24,953 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 33 [2019-10-14 21:50:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,953 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-10-14 21:50:24,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-10-14 21:50:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 21:50:24,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,957 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,958 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash -358527666, now seen corresponding path program 2 times [2019-10-14 21:50:24,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042772612] [2019-10-14 21:50:24,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:25,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042772612] [2019-10-14 21:50:25,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320556447] [2019-10-14 21:50:25,261 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 21:50:25,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:25,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:25,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 21:50:25,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:25,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:25,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:25,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:25,508 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:25,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-14 21:50:25,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055534481] [2019-10-14 21:50:25,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:25,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:25,510 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 16 states. [2019-10-14 21:50:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:25,902 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2019-10-14 21:50:25,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:50:25,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-10-14 21:50:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:25,904 INFO L225 Difference]: With dead ends: 183 [2019-10-14 21:50:25,904 INFO L226 Difference]: Without dead ends: 103 [2019-10-14 21:50:25,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:50:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-14 21:50:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-10-14 21:50:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-14 21:50:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2019-10-14 21:50:25,927 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 38 [2019-10-14 21:50:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:25,927 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2019-10-14 21:50:25,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2019-10-14 21:50:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 21:50:25,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:25,929 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:26,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:26,138 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash 502956661, now seen corresponding path program 3 times [2019-10-14 21:50:26,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:26,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852579365] [2019-10-14 21:50:26,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:26,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852579365] [2019-10-14 21:50:26,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847416325] [2019-10-14 21:50:26,337 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-14 21:50:26,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:50:26,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:26,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:50:26,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:26,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:26,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-14 21:50:26,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:26,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:26,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-14 21:50:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:26,799 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:26,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-10-14 21:50:26,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63330837] [2019-10-14 21:50:26,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 21:50:26,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 21:50:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:50:26,801 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 23 states. [2019-10-14 21:50:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:27,829 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2019-10-14 21:50:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:50:27,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-10-14 21:50:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:27,831 INFO L225 Difference]: With dead ends: 133 [2019-10-14 21:50:27,831 INFO L226 Difference]: Without dead ends: 117 [2019-10-14 21:50:27,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 21:50:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-14 21:50:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2019-10-14 21:50:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 21:50:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-10-14 21:50:27,851 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 42 [2019-10-14 21:50:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:27,852 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-10-14 21:50:27,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 21:50:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-10-14 21:50:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 21:50:27,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:27,853 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:28,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:28,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 268243185, now seen corresponding path program 2 times [2019-10-14 21:50:28,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:28,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698363771] [2019-10-14 21:50:28,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:28,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698363771] [2019-10-14 21:50:28,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305134661] [2019-10-14 21:50:28,217 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 21:50:28,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:28,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:28,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-14 21:50:28,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:28,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:28,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:28,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:28,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:28,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:28,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:28,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:28,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:28,714 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:28,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-10-14 21:50:28,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850459728] [2019-10-14 21:50:28,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:28,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:28,720 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 22 states. [2019-10-14 21:50:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:29,718 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2019-10-14 21:50:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:50:29,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-10-14 21:50:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:29,721 INFO L225 Difference]: With dead ends: 159 [2019-10-14 21:50:29,722 INFO L226 Difference]: Without dead ends: 143 [2019-10-14 21:50:29,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 21:50:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-14 21:50:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-10-14 21:50:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-14 21:50:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-10-14 21:50:29,738 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 42 [2019-10-14 21:50:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:29,739 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-10-14 21:50:29,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-10-14 21:50:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 21:50:29,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:29,740 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:29,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:29,947 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1582060021, now seen corresponding path program 1 times [2019-10-14 21:50:29,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:29,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639199983] [2019-10-14 21:50:29,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:30,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639199983] [2019-10-14 21:50:30,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228604856] [2019-10-14 21:50:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order 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-14 21:50:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 21:50:30,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:30,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:30,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:30,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:30,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:30,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:30,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:30,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:30,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:30,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:30,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:30,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:30,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:30,574 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:30,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-10-14 21:50:30,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279303832] [2019-10-14 21:50:30,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 21:50:30,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 21:50:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:30,577 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 24 states. [2019-10-14 21:50:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:31,451 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2019-10-14 21:50:31,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-14 21:50:31,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-10-14 21:50:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:31,454 INFO L225 Difference]: With dead ends: 169 [2019-10-14 21:50:31,454 INFO L226 Difference]: Without dead ends: 167 [2019-10-14 21:50:31,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2019-10-14 21:50:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-14 21:50:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-10-14 21:50:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-14 21:50:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2019-10-14 21:50:31,473 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 42 [2019-10-14 21:50:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:31,474 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2019-10-14 21:50:31,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 21:50:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2019-10-14 21:50:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 21:50:31,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:31,475 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:31,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:31,682 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash -287327464, now seen corresponding path program 4 times [2019-10-14 21:50:31,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:31,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480280860] [2019-10-14 21:50:31,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:31,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:31,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:31,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480280860] [2019-10-14 21:50:31,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376367557] [2019-10-14 21:50:31,863 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:31,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:31,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:31,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 21:50:31,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:32,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:32,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:32,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:32,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:32,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-14 21:50:32,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:32,145 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:32,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-14 21:50:32,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025458194] [2019-10-14 21:50:32,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:32,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:32,146 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 22 states. [2019-10-14 21:50:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:32,840 INFO L93 Difference]: Finished difference Result 188 states and 218 transitions. [2019-10-14 21:50:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 21:50:32,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-10-14 21:50:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:32,843 INFO L225 Difference]: With dead ends: 188 [2019-10-14 21:50:32,843 INFO L226 Difference]: Without dead ends: 172 [2019-10-14 21:50:32,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 21:50:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-14 21:50:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2019-10-14 21:50:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-14 21:50:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2019-10-14 21:50:32,862 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 51 [2019-10-14 21:50:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:32,863 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2019-10-14 21:50:32,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2019-10-14 21:50:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 21:50:32,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:32,864 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:33,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:33,068 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash 795850780, now seen corresponding path program 3 times [2019-10-14 21:50:33,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:33,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671033701] [2019-10-14 21:50:33,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:33,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:33,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:33,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671033701] [2019-10-14 21:50:33,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125980537] [2019-10-14 21:50:33,231 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:33,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:50:33,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:33,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:50:33,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:33,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:33,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:33,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:49,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:49,597 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:49,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 19 [2019-10-14 21:50:49,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540742078] [2019-10-14 21:50:49,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:50:49,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:50:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=288, Unknown=3, NotChecked=0, Total=342 [2019-10-14 21:50:49,599 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 19 states. [2019-10-14 21:51:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:03,754 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2019-10-14 21:51:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-14 21:51:03,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-10-14 21:51:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:03,757 INFO L225 Difference]: With dead ends: 207 [2019-10-14 21:51:03,757 INFO L226 Difference]: Without dead ends: 205 [2019-10-14 21:51:03,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=213, Invalid=1342, Unknown=5, NotChecked=0, Total=1560 [2019-10-14 21:51:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-14 21:51:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2019-10-14 21:51:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-14 21:51:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2019-10-14 21:51:03,776 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 51 [2019-10-14 21:51:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:03,776 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2019-10-14 21:51:03,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:51:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2019-10-14 21:51:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 21:51:03,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:03,778 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:03,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:03,982 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:03,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash -350451243, now seen corresponding path program 5 times [2019-10-14 21:51:03,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:03,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206507693] [2019-10-14 21:51:03,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:03,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:03,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:51:04,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206507693] [2019-10-14 21:51:04,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370597703] [2019-10-14 21:51:04,419 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:04,474 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-14 21:51:04,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:04,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:51:04,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:04,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:04,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:51:04,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:51:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:51:04,740 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:04,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-14 21:51:04,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550607970] [2019-10-14 21:51:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:51:04,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:51:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:51:04,742 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 22 states. [2019-10-14 21:51:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:05,297 INFO L93 Difference]: Finished difference Result 331 states and 379 transitions. [2019-10-14 21:51:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:51:05,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-10-14 21:51:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:05,300 INFO L225 Difference]: With dead ends: 331 [2019-10-14 21:51:05,300 INFO L226 Difference]: Without dead ends: 179 [2019-10-14 21:51:05,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:51:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.