/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/mbpr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:52:02,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:52:02,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:52:02,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:52:02,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:52:02,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:52:02,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:52:02,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:52:02,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:52:02,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:52:02,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:52:02,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:52:02,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:52:02,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:52:02,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:52:02,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:52:02,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:52:02,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:52:02,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:52:02,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:52:02,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:52:02,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:52:02,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:52:02,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:52:02,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:52:02,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:52:02,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:52:02,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:52:02,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:52:02,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:52:02,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:52:02,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:52:02,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:52:02,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:52:02,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:52:02,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:52:02,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:52:02,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:52:02,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:52:02,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:52:02,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:52:02,809 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:02,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:52:02,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:52:02,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:52:02,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:52:02,825 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:52:02,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:52:02,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:52:02,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:52:02,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:52:02,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:52:02,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:52:02,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:52:02,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:52:02,826 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:52:02,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:52:02,827 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:52:02,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:52:02,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:52:02,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:52:02,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:52:02,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:52:02,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:52:02,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:52:02,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:52:03,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:52:03,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:52:03,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:52:03,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:52:03,124 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:52:03,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr2.c [2019-11-06 18:52:03,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce6a955c/1ac861eaf50f4463808c661d4eeeab7f/FLAG9aa74f255 [2019-11-06 18:52:03,656 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:52:03,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr2.c [2019-11-06 18:52:03,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce6a955c/1ac861eaf50f4463808c661d4eeeab7f/FLAG9aa74f255 [2019-11-06 18:52:04,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce6a955c/1ac861eaf50f4463808c661d4eeeab7f [2019-11-06 18:52:04,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:52:04,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:52:04,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:04,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:52:04,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:52:04,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:04" (1/1) ... [2019-11-06 18:52:04,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7076498d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:04, skipping insertion in model container [2019-11-06 18:52:04,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:04" (1/1) ... [2019-11-06 18:52:04,079 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:52:04,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:52:04,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:04,274 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:52:04,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:04,399 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:52:04,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:04 WrapperNode [2019-11-06 18:52:04,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:04,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:52:04,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:52:04,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:52:04,416 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:04" (1/1) ... [2019-11-06 18:52:04,416 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:04" (1/1) ... [2019-11-06 18:52:04,437 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:04" (1/1) ... [2019-11-06 18:52:04,437 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:04" (1/1) ... [2019-11-06 18:52:04,457 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:04" (1/1) ... [2019-11-06 18:52:04,462 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:04" (1/1) ... [2019-11-06 18:52:04,464 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:04" (1/1) ... [2019-11-06 18:52:04,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:52:04,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:52:04,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:52:04,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:52:04,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:04" (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:04,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:52:04,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:52:04,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:52:04,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:52:04,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:52:04,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:52:04,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:52:04,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:52:04,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:52:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:52:04,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:52:04,839 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:52:04,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:04 BoogieIcfgContainer [2019-11-06 18:52:04,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:52:04,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:52:04,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:52:04,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:52:04,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:52:04" (1/3) ... [2019-11-06 18:52:04,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bc2634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:04, skipping insertion in model container [2019-11-06 18:52:04,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:04" (2/3) ... [2019-11-06 18:52:04,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bc2634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:04, skipping insertion in model container [2019-11-06 18:52:04,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:04" (3/3) ... [2019-11-06 18:52:04,849 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2019-11-06 18:52:04,859 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:52:04,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:52:04,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:52:04,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:52:04,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:52:04,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:52:04,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:52:04,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:52:04,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:52:04,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:52:04,902 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:52:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 18:52:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 18:52:04,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:04,925 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:52:04,927 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1027175342, now seen corresponding path program 1 times [2019-11-06 18:52:04,939 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:04,939 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247795102] [2019-11-06 18:52:04,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,174 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:05,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247795102] [2019-11-06 18:52:05,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:05,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:52:05,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345092476] [2019-11-06 18:52:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:52:05,185 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:52:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:52:05,204 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 18:52:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:05,342 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-11-06 18:52:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:52:05,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 18:52:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:05,354 INFO L225 Difference]: With dead ends: 58 [2019-11-06 18:52:05,354 INFO L226 Difference]: Without dead ends: 29 [2019-11-06 18:52:05,358 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:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-06 18:52:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-06 18:52:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 18:52:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-06 18:52:05,393 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-11-06 18:52:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:05,394 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-06 18:52:05,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:52:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-06 18:52:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 18:52:05,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:05,396 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:52:05,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2086094079, now seen corresponding path program 1 times [2019-11-06 18:52:05,397 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:05,398 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096294447] [2019-11-06 18:52:05,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,521 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:05,522 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096294447] [2019-11-06 18:52:05,522 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:05,522 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 18:52:05,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885304602] [2019-11-06 18:52:05,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:52:05,525 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:52:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:05,526 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 6 states. [2019-11-06 18:52:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:05,689 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-06 18:52:05,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:52:05,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 18:52:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:05,691 INFO L225 Difference]: With dead ends: 37 [2019-11-06 18:52:05,691 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 18:52:05,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:52:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 18:52:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-06 18:52:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 18:52:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-06 18:52:05,702 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2019-11-06 18:52:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:05,703 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-06 18:52:05,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:52:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-11-06 18:52:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 18:52:05,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:05,704 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:52:05,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2087941121, now seen corresponding path program 1 times [2019-11-06 18:52:05,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:05,706 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37501400] [2019-11-06 18:52:05,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:05,814 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:05,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37501400] [2019-11-06 18:52:05,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:05,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:05,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499098767] [2019-11-06 18:52:05,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:05,816 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:05,817 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2019-11-06 18:52:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:05,992 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-11-06 18:52:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:05,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-06 18:52:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:05,996 INFO L225 Difference]: With dead ends: 64 [2019-11-06 18:52:05,996 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 18:52:05,997 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:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 18:52:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-11-06 18:52:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 18:52:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-06 18:52:06,005 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 18 [2019-11-06 18:52:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:06,006 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-06 18:52:06,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-06 18:52:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 18:52:06,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:06,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:06,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1576263499, now seen corresponding path program 1 times [2019-11-06 18:52:06,008 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:06,009 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868168668] [2019-11-06 18:52:06,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:52:06,105 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868168668] [2019-11-06 18:52:06,108 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:06,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:52:06,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147214902] [2019-11-06 18:52:06,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:52:06,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:52:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:52:06,112 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-11-06 18:52:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:06,198 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-06 18:52:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:52:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-06 18:52:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:06,199 INFO L225 Difference]: With dead ends: 57 [2019-11-06 18:52:06,200 INFO L226 Difference]: Without dead ends: 36 [2019-11-06 18:52:06,200 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:52:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-06 18:52:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-06 18:52:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 18:52:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 18:52:06,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-11-06 18:52:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:06,214 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 18:52:06,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:52:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 18:52:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 18:52:06,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:06,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:06,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2017639219, now seen corresponding path program 1 times [2019-11-06 18:52:06,221 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:06,221 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019260834] [2019-11-06 18:52:06,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:07,253 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019260834] [2019-11-06 18:52:07,253 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384982494] [2019-11-06 18:52:07,254 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:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:07,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-06 18:52:07,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:07,442 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:07,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:07,453 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:07,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-06 18:52:07,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:07,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:07,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2019-11-06 18:52:07,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:07,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-06 18:52:07,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:07,565 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:52:07,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:07,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-06 18:52:07,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:07,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:07,661 INFO L341 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2019-11-06 18:52:07,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 51 [2019-11-06 18:52:07,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:07,683 INFO L567 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2019-11-06 18:52:07,685 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:52:07,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-11-06 18:52:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:07,830 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:07,830 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-06 18:52:07,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937400200] [2019-11-06 18:52:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:52:07,831 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:52:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:52:07,832 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 22 states. [2019-11-06 18:52:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:10,217 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-11-06 18:52:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-06 18:52:10,218 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-06 18:52:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:10,222 INFO L225 Difference]: With dead ends: 125 [2019-11-06 18:52:10,222 INFO L226 Difference]: Without dead ends: 98 [2019-11-06 18:52:10,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2019-11-06 18:52:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-06 18:52:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 38. [2019-11-06 18:52:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 18:52:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-06 18:52:10,239 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2019-11-06 18:52:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:10,239 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-06 18:52:10,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:52:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-06 18:52:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 18:52:10,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:10,241 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:10,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:10,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1612272465, now seen corresponding path program 1 times [2019-11-06 18:52:10,453 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:10,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589329851] [2019-11-06 18:52:10,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:11,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589329851] [2019-11-06 18:52:11,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841866111] [2019-11-06 18:52:11,204 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:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:11,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 18:52:11,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:11,313 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:11,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:11,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:11,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:11,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:52:11,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:11,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:11,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2019-11-06 18:52:11,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:11,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:11,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:11,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-11-06 18:52:11,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:52:11,486 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:11,486 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2019-11-06 18:52:11,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637649347] [2019-11-06 18:52:11,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:52:11,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:52:11,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:52:11,488 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 24 states. [2019-11-06 18:52:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:13,185 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-11-06 18:52:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-06 18:52:13,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-11-06 18:52:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:13,188 INFO L225 Difference]: With dead ends: 109 [2019-11-06 18:52:13,188 INFO L226 Difference]: Without dead ends: 107 [2019-11-06 18:52:13,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2019-11-06 18:52:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-06 18:52:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 48. [2019-11-06 18:52:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 18:52:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-11-06 18:52:13,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 35 [2019-11-06 18:52:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:13,201 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-11-06 18:52:13,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:52:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-11-06 18:52:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 18:52:13,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:13,204 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:13,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:13,410 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 692803917, now seen corresponding path program 2 times [2019-11-06 18:52:13,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:13,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763764274] [2019-11-06 18:52:13,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:52:13,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763764274] [2019-11-06 18:52:13,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820127038] [2019-11-06 18:52:13,767 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:52:13,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:13,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:13,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 18:52:13,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:13,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:52:14,023 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:14,023 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-06 18:52:14,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345728045] [2019-11-06 18:52:14,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 18:52:14,024 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 18:52:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-11-06 18:52:14,025 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 18 states. [2019-11-06 18:52:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:14,512 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-06 18:52:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 18:52:14,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-11-06 18:52:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:14,514 INFO L225 Difference]: With dead ends: 125 [2019-11-06 18:52:14,514 INFO L226 Difference]: Without dead ends: 65 [2019-11-06 18:52:14,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-11-06 18:52:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-06 18:52:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-11-06 18:52:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 18:52:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-06 18:52:14,525 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 44 [2019-11-06 18:52:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:14,526 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-06 18:52:14,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 18:52:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-06 18:52:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:52:14,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:14,528 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-06 18:52:14,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:14,732 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1385442279, now seen corresponding path program 3 times [2019-11-06 18:52:14,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:14,734 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175292197] [2019-11-06 18:52:14,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:15,589 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-06 18:52:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:52:15,967 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175292197] [2019-11-06 18:52:15,967 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111753962] [2019-11-06 18:52:15,967 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:52:16,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:52:16,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:16,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:52:16,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:16,120 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:16,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:52:16,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:16,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2019-11-06 18:52:16,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:22 [2019-11-06 18:52:16,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:16,241 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 26 treesize of output 25 [2019-11-06 18:52:16,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:52:16,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:16,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:16,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:16,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-11-06 18:52:16,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:16,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:16,313 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:52:16,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:31 [2019-11-06 18:52:16,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 18:52:16,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:16,605 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 29 [2019-11-06 18:52:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110595421] [2019-11-06 18:52:16,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-06 18:52:16,606 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-06 18:52:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-11-06 18:52:16,606 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 29 states. [2019-11-06 18:52:18,610 WARN L191 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-06 18:52:19,364 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-11-06 18:52:20,424 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-06 18:52:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:21,870 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2019-11-06 18:52:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-06 18:52:21,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-11-06 18:52:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:21,873 INFO L225 Difference]: With dead ends: 133 [2019-11-06 18:52:21,874 INFO L226 Difference]: Without dead ends: 117 [2019-11-06 18:52:21,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=889, Invalid=3271, Unknown=0, NotChecked=0, Total=4160 [2019-11-06 18:52:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-06 18:52:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 56. [2019-11-06 18:52:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 18:52:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-06 18:52:21,889 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2019-11-06 18:52:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:21,890 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-06 18:52:21,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-06 18:52:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-06 18:52:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:52:21,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:21,891 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-06 18:52:22,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:22,094 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1898407767, now seen corresponding path program 4 times [2019-11-06 18:52:22,095 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:22,095 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123880360] [2019-11-06 18:52:22,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:52:23,154 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123880360] [2019-11-06 18:52:23,154 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333882175] [2019-11-06 18:52:23,154 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:52:23,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:52:23,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:23,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 18:52:23,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:23,313 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:23,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,323 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:23,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-06 18:52:23,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2019-11-06 18:52:23,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-11-06 18:52:23,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,430 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 26 treesize of output 25 [2019-11-06 18:52:23,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:52:23,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-11-06 18:52:23,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:31 [2019-11-06 18:52:23,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,548 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 35 treesize of output 37 [2019-11-06 18:52:23,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:23,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-06 18:52:23,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:23,648 INFO L341 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2019-11-06 18:52:23,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 67 [2019-11-06 18:52:23,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:23,676 INFO L567 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-11-06 18:52:23,677 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:52:23,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:40 [2019-11-06 18:52:24,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:52:24,118 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:24,118 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2019-11-06 18:52:24,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972759082] [2019-11-06 18:52:24,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-06 18:52:24,119 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-06 18:52:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 18:52:24,120 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 34 states. [2019-11-06 18:52:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:28,263 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-11-06 18:52:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-06 18:52:28,264 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2019-11-06 18:52:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:28,266 INFO L225 Difference]: With dead ends: 129 [2019-11-06 18:52:28,266 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 18:52:28,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=977, Invalid=4425, Unknown=0, NotChecked=0, Total=5402 [2019-11-06 18:52:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 18:52:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 60. [2019-11-06 18:52:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 18:52:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-06 18:52:28,282 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 52 [2019-11-06 18:52:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-06 18:52:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-06 18:52:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-06 18:52:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 18:52:28,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:28,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:28,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:28,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash -561222649, now seen corresponding path program 5 times [2019-11-06 18:52:28,497 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:28,497 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041256996] [2019-11-06 18:52:28,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:52:28,860 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041256996] [2019-11-06 18:52:28,860 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389920281] [2019-11-06 18:52:28,861 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:52:28,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-06 18:52:28,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:28,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-06 18:52:28,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:29,001 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:29,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:29,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:29,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:29,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:52:29,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:29,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:29,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2019-11-06 18:52:29,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:29,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:29,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:29,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2019-11-06 18:52:29,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 18:52:29,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:29,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2019-11-06 18:52:29,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927185308] [2019-11-06 18:52:29,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-06 18:52:29,432 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-06 18:52:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-11-06 18:52:29,432 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 32 states. [2019-11-06 18:52:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:32,032 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2019-11-06 18:52:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-06 18:52:32,033 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-11-06 18:52:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:32,034 INFO L225 Difference]: With dead ends: 192 [2019-11-06 18:52:32,035 INFO L226 Difference]: Without dead ends: 155 [2019-11-06 18:52:32,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=708, Invalid=4842, Unknown=0, NotChecked=0, Total=5550 [2019-11-06 18:52:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-06 18:52:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 84. [2019-11-06 18:52:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-06 18:52:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-11-06 18:52:32,054 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 61 [2019-11-06 18:52:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:32,055 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-11-06 18:52:32,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-06 18:52:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-11-06 18:52:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-06 18:52:32,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:32,056 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 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:52:32,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:32,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -888558249, now seen corresponding path program 6 times [2019-11-06 18:52:32,263 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:32,263 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10288921] [2019-11-06 18:52:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-06 18:52:32,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10288921] [2019-11-06 18:52:32,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617947732] [2019-11-06 18:52:32,799 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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:52:32,884 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-06 18:52:32,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:32,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 18:52:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:33,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-06 18:52:33,212 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:33,213 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-06 18:52:33,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661626256] [2019-11-06 18:52:33,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:52:33,214 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:33,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:52:33,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:52:33,214 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 24 states. [2019-11-06 18:52:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:33,882 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2019-11-06 18:52:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 18:52:33,883 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-11-06 18:52:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:33,884 INFO L225 Difference]: With dead ends: 146 [2019-11-06 18:52:33,884 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 18:52:33,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-11-06 18:52:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 18:52:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-11-06 18:52:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-06 18:52:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-06 18:52:33,900 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 70 [2019-11-06 18:52:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:33,901 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-06 18:52:33,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:52:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-06 18:52:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 18:52:33,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:33,903 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:34,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:34,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1067609565, now seen corresponding path program 7 times [2019-11-06 18:52:34,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:34,114 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284481409] [2019-11-06 18:52:34,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 18:52:34,816 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284481409] [2019-11-06 18:52:34,816 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74982210] [2019-11-06 18:52:34,816 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:34,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 18:52:34,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:34,956 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:34,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:34,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:34,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:34,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:52:34,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:34,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:35,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2019-11-06 18:52:35,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:35,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:35,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:35,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:22 [2019-11-06 18:52:35,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:35,051 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 26 treesize of output 25 [2019-11-06 18:52:35,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:35,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:35,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:35,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:52:35,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:35,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:35,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:35,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:35,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-11-06 18:52:35,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:35,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:35,121 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:52:35,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:31 [2019-11-06 18:52:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-06 18:52:36,346 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:36,346 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 33 [2019-11-06 18:52:36,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308056374] [2019-11-06 18:52:36,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 18:52:36,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 18:52:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-11-06 18:52:36,348 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 33 states. [2019-11-06 18:52:42,135 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-11-06 18:52:43,121 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-11-06 18:52:44,731 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-06 18:52:45,747 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-11-06 18:52:46,292 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-11-06 18:52:47,014 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 32