/usr/bin/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/pnr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:52:42,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:52:42,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:52:42,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:52:42,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:52:42,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:52:42,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:52:42,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:52:42,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:52:42,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:52:42,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:52:42,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:52:42,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:52:42,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:52:42,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:52:42,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:52:42,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:52:42,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:52:42,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:52:42,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:52:42,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:52:42,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:52:42,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:52:42,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:52:42,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:52:42,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:52:42,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:52:42,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:52:42,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:52:42,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:52:42,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:52:42,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:52:42,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:52:42,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:52:42,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:52:42,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:52:42,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:52:42,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:52:42,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:52:42,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:52:42,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:52:42,128 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-11-06 18:52:42,153 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:52:42,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:52:42,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:52:42,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:52:42,155 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:52:42,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:52:42,155 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:52:42,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:52:42,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:52:42,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:52:42,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:52:42,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:52:42,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:52:42,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:52:42,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:52:42,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:52:42,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:52:42,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:52:42,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:52:42,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:52:42,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:52:42,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:52:42,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:52:42,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:52:42,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:52:42,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:52:42,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:52:42,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:52:42,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:52:42,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:52:42,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:52:42,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:52:42,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:52:42,447 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:52:42,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2.c [2019-11-06 18:52:42,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007522803/bed876c3b1ef4ddca8b5055869860d93/FLAGeeb9bd42b [2019-11-06 18:52:42,949 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:52:42,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2.c [2019-11-06 18:52:42,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007522803/bed876c3b1ef4ddca8b5055869860d93/FLAGeeb9bd42b [2019-11-06 18:52:43,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007522803/bed876c3b1ef4ddca8b5055869860d93 [2019-11-06 18:52:43,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:52:43,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:52:43,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:43,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:52:43,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:52:43,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b94a41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43, skipping insertion in model container [2019-11-06 18:52:43,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:52:43,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:52:43,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:43,585 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:52:43,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:43,623 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:52:43,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43 WrapperNode [2019-11-06 18:52:43,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:43,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:52:43,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:52:43,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:52:43,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (1/1) ... [2019-11-06 18:52:43,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:52:43,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:52:43,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:52:43,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:52:43,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (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-11-06 18:52:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:52:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:52:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:52:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-11-06 18:52:43,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:52:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:52:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:52:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:52:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:52:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 18:52:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-11-06 18:52:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:52:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 18:52:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:52:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:52:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:52:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:52:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:52:44,224 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:52:44,225 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 18:52:44,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:44 BoogieIcfgContainer [2019-11-06 18:52:44,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:52:44,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:52:44,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:52:44,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:52:44,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:52:43" (1/3) ... [2019-11-06 18:52:44,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c60d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:44, skipping insertion in model container [2019-11-06 18:52:44,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:43" (2/3) ... [2019-11-06 18:52:44,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c60d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:44, skipping insertion in model container [2019-11-06 18:52:44,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:44" (3/3) ... [2019-11-06 18:52:44,234 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr2.c [2019-11-06 18:52:44,244 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:52:44,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:52:44,263 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:52:44,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:52:44,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:52:44,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:52:44,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:52:44,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:52:44,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:52:44,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:52:44,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:52:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 18:52:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 18:52:44,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:44,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:44,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1000705867, now seen corresponding path program 1 times [2019-11-06 18:52:44,331 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:44,331 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943612120] [2019-11-06 18:52:44,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:44,527 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943612120] [2019-11-06 18:52:44,528 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:44,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:52:44,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26529885] [2019-11-06 18:52:44,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:52:44,534 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:44,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:52:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:52:44,547 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 18:52:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:44,682 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-06 18:52:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:52:44,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 18:52:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:44,694 INFO L225 Difference]: With dead ends: 51 [2019-11-06 18:52:44,694 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 18:52:44,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:52:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 18:52:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-06 18:52:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 18:52:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 18:52:44,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2019-11-06 18:52:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 18:52:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:52:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 18:52:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 18:52:44,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:44,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:44,748 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash -457002250, now seen corresponding path program 1 times [2019-11-06 18:52:44,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:44,750 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034114910] [2019-11-06 18:52:44,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:44,893 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034114910] [2019-11-06 18:52:44,893 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:44,893 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:44,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108798630] [2019-11-06 18:52:44,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:44,896 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:44,897 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-11-06 18:52:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:45,081 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-11-06 18:52:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:45,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-06 18:52:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:45,084 INFO L225 Difference]: With dead ends: 49 [2019-11-06 18:52:45,084 INFO L226 Difference]: Without dead ends: 38 [2019-11-06 18:52:45,086 INFO L630 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-11-06 18:52:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-06 18:52:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-11-06 18:52:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 18:52:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 18:52:45,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-11-06 18:52:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:45,098 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 18:52:45,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 18:52:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 18:52:45,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:45,100 INFO L410 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, 1, 1, 1, 1, 1] [2019-11-06 18:52:45,100 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1020388245, now seen corresponding path program 1 times [2019-11-06 18:52:45,101 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:45,101 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536982914] [2019-11-06 18:52:45,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:45,806 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536982914] [2019-11-06 18:52:45,806 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580611934] [2019-11-06 18:52:45,806 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-11-06 18:52:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-06 18:52:45,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:45,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-06 18:52:45,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:45,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-06 18:52:46,037 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-06 18:52:46,038 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-11-06 18:52:46,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:46,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:46,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:46,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-11-06 18:52:46,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2019-11-06 18:52:46,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:46,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:46,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:46,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-06 18:52:46,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:46,131 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:46,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-11-06 18:52:46,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701073970] [2019-11-06 18:52:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 18:52:46,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:46,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 18:52:46,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-06 18:52:46,134 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 18 states. [2019-11-06 18:52:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:46,771 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2019-11-06 18:52:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:52:46,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-06 18:52:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:46,774 INFO L225 Difference]: With dead ends: 69 [2019-11-06 18:52:46,774 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 18:52:46,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-11-06 18:52:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 18:52:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-11-06 18:52:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 18:52:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-11-06 18:52:46,799 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-11-06 18:52:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:46,800 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-11-06 18:52:46,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 18:52:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-11-06 18:52:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 18:52:46,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:46,804 INFO L410 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, 1, 1, 1, 1, 1] [2019-11-06 18:52:47,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:47,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1994715373, now seen corresponding path program 1 times [2019-11-06 18:52:47,009 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:47,009 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890058471] [2019-11-06 18:52:47,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:47,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890058471] [2019-11-06 18:52:47,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3282283] [2019-11-06 18:52:47,461 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-11-06 18:52:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:47,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-06 18:52:47,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:47,584 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-11-06 18:52:47,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:47,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:52:47,698 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-06 18:52:47,698 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 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 18:52:47,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:47,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-06 18:52:47,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-11-06 18:52:47,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:47,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:47,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-06 18:52:47,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:47,825 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:47,826 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-06 18:52:47,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583001375] [2019-11-06 18:52:47,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:52:47,827 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:52:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:52:47,829 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 21 states. [2019-11-06 18:52:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:49,360 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-11-06 18:52:49,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 18:52:49,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-06 18:52:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:49,366 INFO L225 Difference]: With dead ends: 139 [2019-11-06 18:52:49,366 INFO L226 Difference]: Without dead ends: 137 [2019-11-06 18:52:49,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2019-11-06 18:52:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-06 18:52:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 37. [2019-11-06 18:52:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 18:52:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 18:52:49,382 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 29 [2019-11-06 18:52:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:49,382 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 18:52:49,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:52:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 18:52:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 18:52:49,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:49,384 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:49,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:49,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash 552081240, now seen corresponding path program 1 times [2019-11-06 18:52:49,589 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:49,589 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710387347] [2019-11-06 18:52:49,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:49,714 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710387347] [2019-11-06 18:52:49,714 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434923569] [2019-11-06 18:52:49,714 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-11-06 18:52:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:49,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:52:49,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:49,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-06 18:52:49,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:49,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:49,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:49,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-11-06 18:52:49,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2019-11-06 18:52:49,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:49,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:49,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:49,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-11-06 18:52:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:49,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:49,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-06 18:52:49,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065885852] [2019-11-06 18:52:49,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 18:52:49,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 18:52:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-06 18:52:49,851 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 13 states. [2019-11-06 18:52:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:50,113 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-11-06 18:52:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 18:52:50,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-11-06 18:52:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:50,115 INFO L225 Difference]: With dead ends: 72 [2019-11-06 18:52:50,115 INFO L226 Difference]: Without dead ends: 70 [2019-11-06 18:52:50,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-06 18:52:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-06 18:52:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2019-11-06 18:52:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 18:52:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-11-06 18:52:50,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 37 [2019-11-06 18:52:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:50,129 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-11-06 18:52:50,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 18:52:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-11-06 18:52:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 18:52:50,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:50,131 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:50,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:50,343 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1036266662, now seen corresponding path program 1 times [2019-11-06 18:52:50,344 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:50,344 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527670143] [2019-11-06 18:52:50,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:50,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527670143] [2019-11-06 18:52:50,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354495948] [2019-11-06 18:52:50,509 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-11-06 18:52:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:52:50,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:50,604 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-11-06 18:52:50,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:50,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-06 18:52:50,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2019-11-06 18:52:50,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:50,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-11-06 18:52:50,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:52:50,775 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:50,775 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-06 18:52:50,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938188637] [2019-11-06 18:52:50,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:52:50,776 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:52:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:52:50,777 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 21 states. [2019-11-06 18:52:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:57,998 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-11-06 18:52:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 18:52:57,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-11-06 18:52:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:58,001 INFO L225 Difference]: With dead ends: 114 [2019-11-06 18:52:58,002 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 18:52:58,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 18:52:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 18:52:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2019-11-06 18:52:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 18:52:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-06 18:52:58,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2019-11-06 18:52:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:58,020 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-06 18:52:58,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:52:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-06 18:52:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 18:52:58,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:58,022 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1] [2019-11-06 18:52:58,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:58,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash -849160891, now seen corresponding path program 2 times [2019-11-06 18:52:58,226 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:58,226 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608450705] [2019-11-06 18:52:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 18:52:58,618 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608450705] [2019-11-06 18:52:58,620 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751807169] [2019-11-06 18:52:58,627 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-11-06 18:52:58,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:58,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:58,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 18:52:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:58,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:58,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 18:52:59,029 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:59,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-06 18:52:59,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197148080] [2019-11-06 18:52:59,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 18:52:59,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 18:52:59,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-06 18:52:59,034 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 17 states. [2019-11-06 18:52:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:59,548 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-06 18:52:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 18:52:59,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-11-06 18:52:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:59,550 INFO L225 Difference]: With dead ends: 90 [2019-11-06 18:52:59,550 INFO L226 Difference]: Without dead ends: 62 [2019-11-06 18:52:59,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:52:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-06 18:52:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-11-06 18:52:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 18:52:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-06 18:52:59,562 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-11-06 18:52:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-06 18:52:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 18:52:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-06 18:52:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 18:52:59,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:59,564 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:59,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:59,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash -418118662, now seen corresponding path program 3 times [2019-11-06 18:52:59,768 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:59,768 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313954416] [2019-11-06 18:52:59,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 18:52:59,985 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313954416] [2019-11-06 18:52:59,986 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545559134] [2019-11-06 18:52:59,986 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-11-06 18:53:00,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:53:00,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:00,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-06 18:53:00,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:00,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-06 18:53:00,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:00,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-06 18:53:00,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:00,253 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 24 treesize of output 23 [2019-11-06 18:53:00,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:00,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-06 18:53:00,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2019-11-06 18:53:00,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:00,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-11-06 18:53:00,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:53:00,572 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:00,572 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-06 18:53:00,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309425934] [2019-11-06 18:53:00,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:53:00,574 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:53:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:53:00,575 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 24 states. [2019-11-06 18:53:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:30,645 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-11-06 18:53:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 18:53:30,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-11-06 18:53:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:30,648 INFO L225 Difference]: With dead ends: 133 [2019-11-06 18:53:30,649 INFO L226 Difference]: Without dead ends: 131 [2019-11-06 18:53:30,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 18:53:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-06 18:53:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 74. [2019-11-06 18:53:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 18:53:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-06 18:53:30,664 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 59 [2019-11-06 18:53:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:30,664 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-06 18:53:30,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:53:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-06 18:53:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 18:53:30,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:30,666 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:30,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:30,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash 283481212, now seen corresponding path program 1 times [2019-11-06 18:53:30,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:30,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118000999] [2019-11-06 18:53:30,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 18:53:31,144 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118000999] [2019-11-06 18:53:31,144 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971020922] [2019-11-06 18:53:31,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 18:53:31,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:31,288 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-11-06 18:53:31,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:31,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:31,382 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-06 18:53:31,383 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:31,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:31,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-06 18:53:31,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2019-11-06 18:53:31,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:31,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-11-06 18:53:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:53:31,643 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:31,644 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-06 18:53:31,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768661685] [2019-11-06 18:53:31,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-06 18:53:31,645 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-06 18:53:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-11-06 18:53:31,645 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 25 states.