/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/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:54:19,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:54:19,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:54:19,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:54:19,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:54:19,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:54:19,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:54:19,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:54:19,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:54:19,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:54:19,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:54:19,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:54:19,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:54:19,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:54:19,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:54:19,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:54:19,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:54:19,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:54:19,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:54:19,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:54:19,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:54:19,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:54:19,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:54:19,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:54:19,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:54:19,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:54:19,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:54:19,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:54:19,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:54:19,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:54:19,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:54:19,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:54:19,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:54:19,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:54:19,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:54:19,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:54:19,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:54:19,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:54:19,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:54:19,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:54:19,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:54:19,314 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:54:19,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:54:19,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:54:19,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:54:19,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:54:19,333 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:54:19,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:54:19,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:54:19,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:54:19,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:54:19,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:54:19,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:54:19,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:54:19,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:54:19,336 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:54:19,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:54:19,336 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:54:19,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:54:19,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:54:19,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:54:19,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:54:19,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:54:19,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:54:19,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:54:19,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:54:19,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:54:19,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:54:19,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:54:19,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:54:19,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:54:19,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:54:19,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:54:19,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:54:19,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:54:19,665 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:54:19,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-06 18:54:19,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed522e0b/100445adf0574499a17a1e3463910469/FLAG38194a222 [2019-11-06 18:54:20,213 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:54:20,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev.c [2019-11-06 18:54:20,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed522e0b/100445adf0574499a17a1e3463910469/FLAG38194a222 [2019-11-06 18:54:20,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed522e0b/100445adf0574499a17a1e3463910469 [2019-11-06 18:54:20,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:54:20,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:54:20,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:54:20,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:54:20,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:54:20,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:20,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d89586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20, skipping insertion in model container [2019-11-06 18:54:20,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:20,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:54:20,664 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:54:20,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:54:20,867 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:54:20,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:54:20,897 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:54:20,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20 WrapperNode [2019-11-06 18:54:20,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:54:20,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:54:20,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:54:20,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:54:20,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:20,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:20,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:20,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:21,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:21,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:21,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (1/1) ... [2019-11-06 18:54:21,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:54:21,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:54:21,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:54:21,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:54:21,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (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:54:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:54:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:54:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:54:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:54:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:54:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:54:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:54:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:54:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:54:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:54:21,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:54:21,343 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 18:54:21,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:21 BoogieIcfgContainer [2019-11-06 18:54:21,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:54:21,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:54:21,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:54:21,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:54:21,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:54:20" (1/3) ... [2019-11-06 18:54:21,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777d8602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:21, skipping insertion in model container [2019-11-06 18:54:21,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:20" (2/3) ... [2019-11-06 18:54:21,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777d8602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:21, skipping insertion in model container [2019-11-06 18:54:21,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:21" (3/3) ... [2019-11-06 18:54:21,353 INFO L109 eAbstractionObserver]: Analyzing ICFG rewrev.c [2019-11-06 18:54:21,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:54:21,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:54:21,387 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:54:21,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:54:21,419 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:54:21,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:54:21,419 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:54:21,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:54:21,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:54:21,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:54:21,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:54:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-06 18:54:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 18:54:21,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:21,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:21,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-11-06 18:54:21,469 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:21,469 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528709483] [2019-11-06 18:54:21,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:21,660 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:54:21,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528709483] [2019-11-06 18:54:21,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:21,662 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:54:21,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792213772] [2019-11-06 18:54:21,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:54:21,668 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:54:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:54:21,684 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-06 18:54:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:21,838 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-06 18:54:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:54:21,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-06 18:54:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:21,851 INFO L225 Difference]: With dead ends: 43 [2019-11-06 18:54:21,851 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 18:54:21,859 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:54:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 18:54:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 18:54:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 18:54:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-06 18:54:21,919 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-11-06 18:54:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:21,920 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-06 18:54:21,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:54:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-06 18:54:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 18:54:21,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:21,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:21,924 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-11-06 18:54:21,925 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:21,925 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468365015] [2019-11-06 18:54:21,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,058 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:54:22,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468365015] [2019-11-06 18:54:22,062 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:22,062 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:54:22,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680764276] [2019-11-06 18:54:22,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:54:22,065 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:22,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:54:22,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:22,066 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-11-06 18:54:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:22,142 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-11-06 18:54:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:54:22,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 18:54:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:22,144 INFO L225 Difference]: With dead ends: 41 [2019-11-06 18:54:22,144 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 18:54:22,146 INFO L630 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-11-06 18:54:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 18:54:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-06 18:54:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 18:54:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-06 18:54:22,154 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-11-06 18:54:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:22,154 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-06 18:54:22,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:54:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-06 18:54:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 18:54:22,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:22,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:22,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-11-06 18:54:22,157 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:22,158 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634435002] [2019-11-06 18:54:22,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:22,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634435002] [2019-11-06 18:54:22,262 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:22,262 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:54:22,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951077087] [2019-11-06 18:54:22,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:54:22,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:22,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:54:22,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:54:22,264 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-11-06 18:54:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:22,363 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-06 18:54:22,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:54:22,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-06 18:54:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:22,366 INFO L225 Difference]: With dead ends: 38 [2019-11-06 18:54:22,367 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 18:54:22,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:54:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 18:54:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 18:54:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 18:54:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-06 18:54:22,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-11-06 18:54:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:22,380 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-06 18:54:22,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:54:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-06 18:54:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:54:22,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:22,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:22,383 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-11-06 18:54:22,383 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:22,384 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361309284] [2019-11-06 18:54:22,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:22,871 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361309284] [2019-11-06 18:54:22,871 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202308605] [2019-11-06 18:54:22,871 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:54:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:22,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 18:54:22,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:23,100 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:54:23,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:23,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:23,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:54:23,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-06 18:54:23,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:23,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-06 18:54:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:23,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:23,239 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-06 18:54:23,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:23,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2019-11-06 18:54:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:54:23,318 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:23,318 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-06 18:54:23,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319805730] [2019-11-06 18:54:23,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:54:23,319 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:54:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:54:23,321 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 21 states. [2019-11-06 18:54:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:23,990 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-06 18:54:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 18:54:23,991 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-11-06 18:54:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:23,992 INFO L225 Difference]: With dead ends: 39 [2019-11-06 18:54:23,993 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:54:23,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2019-11-06 18:54:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:54:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-11-06 18:54:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 18:54:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-06 18:54:24,002 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-11-06 18:54:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:24,003 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-06 18:54:24,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:54:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-06 18:54:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 18:54:24,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:24,004 INFO L410 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] [2019-11-06 18:54:24,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:24,209 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-11-06 18:54:24,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:24,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282966623] [2019-11-06 18:54:24,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:24,651 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282966623] [2019-11-06 18:54:24,651 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102646791] [2019-11-06 18:54:24,652 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:54:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 18:54:24,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:24,748 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:54:24,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:24,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:24,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:24,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:54:24,865 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-06 18:54:24,865 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 38 treesize of output 28 [2019-11-06 18:54:24,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:24,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:24,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 18:54:24,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-11-06 18:54:25,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2019-11-06 18:54:25,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:25,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:25,258 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-06 18:54:25,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:7 [2019-11-06 18:54:25,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:25,339 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:25,339 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-11-06 18:54:25,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112756879] [2019-11-06 18:54:25,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-06 18:54:25,341 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-06 18:54:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-11-06 18:54:25,342 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 28 states. [2019-11-06 18:54:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:43,437 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-11-06 18:54:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 18:54:43,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-11-06 18:54:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:43,444 INFO L225 Difference]: With dead ends: 79 [2019-11-06 18:54:43,444 INFO L226 Difference]: Without dead ends: 77 [2019-11-06 18:54:43,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=371, Invalid=2385, Unknown=0, NotChecked=0, Total=2756 [2019-11-06 18:54:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-06 18:54:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-11-06 18:54:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 18:54:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-06 18:54:43,458 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2019-11-06 18:54:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-06 18:54:43,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-06 18:54:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-06 18:54:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 18:54:43,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:43,460 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:43,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:43,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash 783487204, now seen corresponding path program 2 times [2019-11-06 18:54:43,665 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:43,665 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856356672] [2019-11-06 18:54:43,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:43,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856356672] [2019-11-06 18:54:43,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369216976] [2019-11-06 18:54:43,795 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 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:54:43,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:54:43,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:43,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-06 18:54:43,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:43,889 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:43,889 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-06 18:54:43,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905597271] [2019-11-06 18:54:43,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 18:54:43,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 18:54:43,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-06 18:54:43,891 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2019-11-06 18:54:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:44,104 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-11-06 18:54:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 18:54:44,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-06 18:54:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:44,107 INFO L225 Difference]: With dead ends: 82 [2019-11-06 18:54:44,107 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 18:54:44,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:54:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 18:54:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-06 18:54:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 18:54:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-11-06 18:54:44,117 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2019-11-06 18:54:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:44,117 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-11-06 18:54:44,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 18:54:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-11-06 18:54:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 18:54:44,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:44,119 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:44,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:44,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1309226143, now seen corresponding path program 3 times [2019-11-06 18:54:44,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:44,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776469589] [2019-11-06 18:54:44,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:44,677 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776469589] [2019-11-06 18:54:44,677 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916192069] [2019-11-06 18:54:44,678 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 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:54:44,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 18:54:44,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:44,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-06 18:54:44,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:44,778 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:54:44,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:44,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:44,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:44,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:54:44,857 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-06 18:54:44,858 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 28 treesize of output 27 [2019-11-06 18:54:44,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:44,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:44,869 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:54:44,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-11-06 18:54:44,889 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-06 18:54:44,890 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 29 treesize of output 28 [2019-11-06 18:54:44,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:44,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:44,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:44,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-06 18:54:45,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:45,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2019-11-06 18:54:45,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:45,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:45,101 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-11-06 18:54:45,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2019-11-06 18:54:45,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:45,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:54:45,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:45,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 16 [2019-11-06 18:54:45,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:45,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:45,619 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:54:45,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2019-11-06 18:54:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:54:45,722 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:45,722 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-11-06 18:54:45,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451583162] [2019-11-06 18:54:45,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 18:54:45,723 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 18:54:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-11-06 18:54:45,724 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 33 states. [2019-11-06 18:54:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:55,979 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-11-06 18:54:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 18:54:55,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-11-06 18:54:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:55,982 INFO L225 Difference]: With dead ends: 61 [2019-11-06 18:54:55,982 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 18:54:55,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=394, Invalid=2468, Unknown=0, NotChecked=0, Total=2862 [2019-11-06 18:54:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 18:54:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-06 18:54:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 18:54:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-06 18:54:55,995 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2019-11-06 18:54:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:55,995 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-06 18:54:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-06 18:54:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-06 18:54:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 18:54:55,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:55,997 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:56,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:56,201 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash -65371085, now seen corresponding path program 4 times [2019-11-06 18:54:56,202 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:56,203 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766282643] [2019-11-06 18:54:56,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:54:56,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766282643] [2019-11-06 18:54:56,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805558863] [2019-11-06 18:54:56,285 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 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:54:56,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:54:56,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:56,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 18:54:56,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:54:56,392 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:56,392 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-06 18:54:56,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686090739] [2019-11-06 18:54:56,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 18:54:56,393 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 18:54:56,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:54:56,393 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 14 states. [2019-11-06 18:54:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:56,587 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-06 18:54:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 18:54:56,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-06 18:54:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:56,588 INFO L225 Difference]: With dead ends: 102 [2019-11-06 18:54:56,588 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 18:54:56,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-06 18:54:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 18:54:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-06 18:54:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 18:54:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-06 18:54:56,600 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 50 [2019-11-06 18:54:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:56,600 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-06 18:54:56,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 18:54:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-06 18:54:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-06 18:54:56,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:56,602 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:56,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:56,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash -301340818, now seen corresponding path program 5 times [2019-11-06 18:54:56,808 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:56,808 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543070823] [2019-11-06 18:54:56,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:54:57,504 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543070823] [2019-11-06 18:54:57,505 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572389218] [2019-11-06 18:54:57,505 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 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:54:57,574 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-06 18:54:57,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:57,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 18:54:57,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:57,621 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:54:57,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:57,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:54:57,701 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-06 18:54:57,702 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 28 treesize of output 27 [2019-11-06 18:54:57,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:57,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-06 18:54:57,770 INFO L341 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2019-11-06 18:54:57,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2019-11-06 18:54:57,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:57,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-06 18:54:57,919 INFO L341 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-06 18:54:57,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 54 [2019-11-06 18:54:57,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:57,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:57,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-06 18:54:58,012 INFO L341 Elim1Store]: treesize reduction 225, result has 13.8 percent of original size [2019-11-06 18:54:58,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 57 [2019-11-06 18:54:58,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:58,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:58,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:58,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:46 [2019-11-06 18:54:58,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:58,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:58,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 58 [2019-11-06 18:54:58,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:58,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:58,260 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-11-06 18:54:58,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:90 [2019-11-06 18:54:59,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:59,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:54:59,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:59,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 19 [2019-11-06 18:54:59,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:59,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:59,031 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:54:59,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:7 [2019-11-06 18:54:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 18:54:59,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:59,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2019-11-06 18:54:59,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105637737] [2019-11-06 18:54:59,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-06 18:54:59,160 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-06 18:54:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2019-11-06 18:54:59,161 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 41 states.