/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:33:45,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:33:45,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:33:45,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:33:45,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:33:45,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:33:45,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:33:45,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:33:45,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:33:45,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:33:45,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:33:45,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:33:45,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:33:45,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:33:45,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:33:45,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:33:45,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:33:45,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:33:45,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:33:45,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:33:45,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:33:45,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:33:45,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:33:45,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:33:45,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:33:45,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:33:45,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:33:45,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:33:45,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:33:45,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:33:45,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:33:45,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:33:45,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:33:45,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:33:45,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:33:45,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:33:45,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:33:45,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:33:45,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:33:45,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:33:45,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:33:45,886 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-23 20:33:45,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:33:45,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:33:45,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:33:45,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:33:45,913 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:33:45,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:33:45,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:33:45,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:33:45,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:33:45,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:33:45,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:33:45,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:33:45,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:33:45,916 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:33:45,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:33:45,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:33:45,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:33:45,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:33:45,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:33:45,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:33:45,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:33:45,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:33:45,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:33:45,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:33:45,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:33:45,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:33:45,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:33:45,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:33:45,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:33:45,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:33:46,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:33:46,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:33:46,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:33:46,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:33:46,242 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:33:46,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-11-23 20:33:46,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009426411/fa7053d0a83343d1b4305642c6a7ba8a/FLAG60e061e27 [2019-11-23 20:33:46,772 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:33:46,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-11-23 20:33:46,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009426411/fa7053d0a83343d1b4305642c6a7ba8a/FLAG60e061e27 [2019-11-23 20:33:47,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009426411/fa7053d0a83343d1b4305642c6a7ba8a [2019-11-23 20:33:47,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:33:47,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:33:47,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:33:47,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:33:47,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:33:47,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ee21c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47, skipping insertion in model container [2019-11-23 20:33:47,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:33:47,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:33:47,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:33:47,428 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:33:47,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:33:47,468 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:33:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47 WrapperNode [2019-11-23 20:33:47,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:33:47,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:33:47,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:33:47,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:33:47,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:33:47,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:33:47,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:33:47,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:33:47,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (1/1) ... [2019-11-23 20:33:47,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:33:47,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:33:47,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:33:47,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:33:47,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (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-23 20:33:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:33:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:33:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:33:47,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:33:47,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:33:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:33:47,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:33:47,943 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 20:33:47,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:47 BoogieIcfgContainer [2019-11-23 20:33:47,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:33:47,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:33:47,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:33:47,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:33:47,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:33:47" (1/3) ... [2019-11-23 20:33:47,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:33:47, skipping insertion in model container [2019-11-23 20:33:47,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:47" (2/3) ... [2019-11-23 20:33:47,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:33:47, skipping insertion in model container [2019-11-23 20:33:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:47" (3/3) ... [2019-11-23 20:33:47,954 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2019-11-23 20:33:47,970 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:33:47,980 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:33:48,018 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:33:48,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:33:48,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:33:48,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:33:48,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:33:48,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:33:48,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:33:48,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:33:48,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:33:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-23 20:33:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:33:48,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:48,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:48,072 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1960333522, now seen corresponding path program 1 times [2019-11-23 20:33:48,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:48,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756769533] [2019-11-23 20:33:48,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:48,243 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-23 20:33:48,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756769533] [2019-11-23 20:33:48,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:33:48,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:33:48,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366060472] [2019-11-23 20:33:48,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:33:48,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:48,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:33:48,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:33:48,267 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-11-23 20:33:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:48,309 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2019-11-23 20:33:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:33:48,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-23 20:33:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:48,321 INFO L225 Difference]: With dead ends: 26 [2019-11-23 20:33:48,322 INFO L226 Difference]: Without dead ends: 13 [2019-11-23 20:33:48,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:33:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-23 20:33:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-23 20:33:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-23 20:33:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-23 20:33:48,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-11-23 20:33:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:48,366 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-23 20:33:48,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:33:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-11-23 20:33:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:33:48,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:48,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:48,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1620761708, now seen corresponding path program 1 times [2019-11-23 20:33:48,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:48,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458862459] [2019-11-23 20:33:48,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:33:48,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458862459] [2019-11-23 20:33:48,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:33:48,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:33:48,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589084131] [2019-11-23 20:33:48,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:33:48,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:33:48,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:33:48,568 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2019-11-23 20:33:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:48,622 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-23 20:33:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:33:48,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-23 20:33:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:48,624 INFO L225 Difference]: With dead ends: 17 [2019-11-23 20:33:48,624 INFO L226 Difference]: Without dead ends: 14 [2019-11-23 20:33:48,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:33:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-23 20:33:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-23 20:33:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-23 20:33:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-23 20:33:48,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-11-23 20:33:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:48,630 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-23 20:33:48,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:33:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-23 20:33:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 20:33:48,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:48,632 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:48,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1523215281, now seen corresponding path program 1 times [2019-11-23 20:33:48,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:48,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484276277] [2019-11-23 20:33:48,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:33:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484276277] [2019-11-23 20:33:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085697594] [2019-11-23 20:33:48,684 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-23 20:33:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:48,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:33:48,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:33:48,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:48,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 20:33:48,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806150172] [2019-11-23 20:33:48,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:33:48,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:33:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:33:48,790 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-11-23 20:33:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:48,819 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-23 20:33:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:33:48,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 20:33:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:48,821 INFO L225 Difference]: With dead ends: 26 [2019-11-23 20:33:48,821 INFO L226 Difference]: Without dead ends: 17 [2019-11-23 20:33:48,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:33:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-23 20:33:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-23 20:33:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 20:33:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-11-23 20:33:48,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-11-23 20:33:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:48,827 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-23 20:33:48,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:33:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-11-23 20:33:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:33:48,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:48,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:49,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:49,032 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash 112456333, now seen corresponding path program 2 times [2019-11-23 20:33:49,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:49,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274384088] [2019-11-23 20:33:49,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:33:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274384088] [2019-11-23 20:33:49,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052928495] [2019-11-23 20:33:49,096 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 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-23 20:33:49,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:33:49,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:49,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:33:49,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:33:49,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:49,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 20:33:49,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118661296] [2019-11-23 20:33:49,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:33:49,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:33:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:33:49,164 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-11-23 20:33:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:49,197 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-11-23 20:33:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:33:49,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-23 20:33:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:49,199 INFO L225 Difference]: With dead ends: 28 [2019-11-23 20:33:49,199 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 20:33:49,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:33:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 20:33:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-23 20:33:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-23 20:33:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-23 20:33:49,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-11-23 20:33:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:49,205 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-23 20:33:49,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:33:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-23 20:33:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:33:49,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:49,206 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:49,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:49,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash 34847051, now seen corresponding path program 3 times [2019-11-23 20:33:49,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:49,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463017797] [2019-11-23 20:33:49,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:33:49,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463017797] [2019-11-23 20:33:49,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921606378] [2019-11-23 20:33:49,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:49,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-23 20:33:49,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:49,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:33:49,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:49,692 INFO L377 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 15 treesize of output 11 [2019-11-23 20:33:49,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:49,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:49,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:49,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:33:49,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:49,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-23 20:33:49,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 20:33:49,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:49,773 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-23 20:33:49,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2019-11-23 20:33:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:33:49,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:49,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-11-23 20:33:49,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170208621] [2019-11-23 20:33:49,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:33:49,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:49,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:33:49,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:33:49,863 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2019-11-23 20:33:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:50,051 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-23 20:33:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:33:50,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-23 20:33:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:50,053 INFO L225 Difference]: With dead ends: 33 [2019-11-23 20:33:50,053 INFO L226 Difference]: Without dead ends: 23 [2019-11-23 20:33:50,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:33:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-23 20:33:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-23 20:33:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:33:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-23 20:33:50,059 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2019-11-23 20:33:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:50,059 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-23 20:33:50,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:33:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-23 20:33:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:33:50,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:50,062 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:50,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:50,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -261296852, now seen corresponding path program 4 times [2019-11-23 20:33:50,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:50,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714324152] [2019-11-23 20:33:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:33:50,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714324152] [2019-11-23 20:33:50,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426349841] [2019-11-23 20:33:50,333 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:50,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:33:50,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:50,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 20:33:50,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:33:50,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:50,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-23 20:33:50,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876752854] [2019-11-23 20:33:50,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:33:50,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:33:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:33:50,393 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2019-11-23 20:33:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:50,446 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-23 20:33:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:33:50,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-23 20:33:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:50,447 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:33:50,447 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:33:50,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:33:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:33:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-23 20:33:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 20:33:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-23 20:33:50,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-11-23 20:33:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:50,457 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-23 20:33:50,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:33:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-23 20:33:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:33:50,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:50,458 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:50,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:50,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash -46125718, now seen corresponding path program 5 times [2019-11-23 20:33:50,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:50,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500191075] [2019-11-23 20:33:50,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:33:50,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500191075] [2019-11-23 20:33:50,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584942742] [2019-11-23 20:33:50,778 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 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-23 20:33:50,832 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 20:33:50,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:50,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 20:33:50,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:33:50,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:50,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-23 20:33:50,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125563237] [2019-11-23 20:33:50,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 20:33:50,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 20:33:50,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:33:50,857 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-11-23 20:33:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:50,889 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-23 20:33:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 20:33:50,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-23 20:33:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:50,892 INFO L225 Difference]: With dead ends: 38 [2019-11-23 20:33:50,892 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:33:50,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:33:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:33:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-23 20:33:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 20:33:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-23 20:33:50,898 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-11-23 20:33:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:50,898 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-23 20:33:50,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 20:33:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-23 20:33:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:33:50,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:50,900 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:51,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:51,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash 574903848, now seen corresponding path program 6 times [2019-11-23 20:33:51,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:51,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626827512] [2019-11-23 20:33:51,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:33:51,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626827512] [2019-11-23 20:33:51,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398759013] [2019-11-23 20:33:51,232 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 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-23 20:33:51,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 20:33:51,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:51,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:33:51,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:51,326 INFO L377 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 15 treesize of output 11 [2019-11-23 20:33:51,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:51,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:51,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:51,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:33:51,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:33:51,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:51,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 33 [2019-11-23 20:33:51,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:51,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:51,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:51,457 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-23 20:33:51,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-23 20:33:51,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:51,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:33:51,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:51,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-11-23 20:33:51,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121341220] [2019-11-23 20:33:51,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:33:51,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:33:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:33:51,537 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2019-11-23 20:33:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:51,833 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-23 20:33:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 20:33:51,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-11-23 20:33:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:51,834 INFO L225 Difference]: With dead ends: 43 [2019-11-23 20:33:51,835 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:33:51,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:33:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:33:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-23 20:33:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 20:33:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-23 20:33:51,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-23 20:33:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:51,841 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-23 20:33:51,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:33:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-23 20:33:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:33:51,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:51,842 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:52,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:52,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -477288247, now seen corresponding path program 7 times [2019-11-23 20:33:52,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:52,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210965735] [2019-11-23 20:33:52,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:33:52,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210965735] [2019-11-23 20:33:52,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078418645] [2019-11-23 20:33:52,139 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 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-23 20:33:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:52,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 20:33:52,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:33:52,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:52,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-23 20:33:52,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194084289] [2019-11-23 20:33:52,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 20:33:52,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 20:33:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:33:52,211 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2019-11-23 20:33:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:52,256 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-11-23 20:33:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:33:52,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-11-23 20:33:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:52,257 INFO L225 Difference]: With dead ends: 46 [2019-11-23 20:33:52,257 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 20:33:52,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:33:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 20:33:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-23 20:33:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 20:33:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-23 20:33:52,263 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-11-23 20:33:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:52,263 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-23 20:33:52,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 20:33:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-23 20:33:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:33:52,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:52,264 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:52,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:52,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1907575559, now seen corresponding path program 8 times [2019-11-23 20:33:52,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:52,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784853952] [2019-11-23 20:33:52,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:33:52,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784853952] [2019-11-23 20:33:52,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718810859] [2019-11-23 20:33:52,577 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 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-23 20:33:52,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:33:52,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:52,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:33:52,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:33:52,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:52,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-23 20:33:52,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50680053] [2019-11-23 20:33:52,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:33:52,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:33:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:33:52,652 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-11-23 20:33:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:52,703 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-11-23 20:33:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:33:52,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-23 20:33:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:52,708 INFO L225 Difference]: With dead ends: 48 [2019-11-23 20:33:52,708 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 20:33:52,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:33:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 20:33:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-23 20:33:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 20:33:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-23 20:33:52,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2019-11-23 20:33:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:52,721 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-23 20:33:52,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:33:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-23 20:33:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:33:52,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:52,724 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:52,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:52,930 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash 249157061, now seen corresponding path program 9 times [2019-11-23 20:33:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:52,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931096404] [2019-11-23 20:33:52,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:33:53,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931096404] [2019-11-23 20:33:53,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791045296] [2019-11-23 20:33:53,028 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:53,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:33:53,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:53,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:33:53,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:53,153 INFO L377 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 15 treesize of output 11 [2019-11-23 20:33:53,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:53,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:53,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:53,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:33:53,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:53,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 67 [2019-11-23 20:33:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:53,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:53,377 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-23 20:33:53,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:53 [2019-11-23 20:33:53,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 20:33:53,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:53,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-23 20:33:53,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888196097] [2019-11-23 20:33:53,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:33:53,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:53,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:33:53,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:33:53,550 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 22 states. [2019-11-23 20:33:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:54,005 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-11-23 20:33:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:33:54,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-11-23 20:33:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:54,011 INFO L225 Difference]: With dead ends: 53 [2019-11-23 20:33:54,011 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 20:33:54,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:33:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 20:33:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-23 20:33:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 20:33:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-23 20:33:54,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-11-23 20:33:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:54,018 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-23 20:33:54,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:33:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-23 20:33:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 20:33:54,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:54,019 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:54,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:54,228 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash -52259034, now seen corresponding path program 10 times [2019-11-23 20:33:54,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:54,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273780062] [2019-11-23 20:33:54,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:33:54,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273780062] [2019-11-23 20:33:54,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297988126] [2019-11-23 20:33:54,354 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:54,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:33:54,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:54,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:33:54,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:33:54,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:54,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-23 20:33:54,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624209507] [2019-11-23 20:33:54,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:33:54,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:33:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:33:54,424 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-11-23 20:33:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:54,464 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-11-23 20:33:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:33:54,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-23 20:33:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:54,466 INFO L225 Difference]: With dead ends: 56 [2019-11-23 20:33:54,466 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 20:33:54,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:33:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 20:33:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-23 20:33:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 20:33:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-23 20:33:54,471 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2019-11-23 20:33:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:54,471 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-23 20:33:54,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:33:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-23 20:33:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:33:54,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:54,472 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:54,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:54,677 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 72981348, now seen corresponding path program 11 times [2019-11-23 20:33:54,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:54,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909989281] [2019-11-23 20:33:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:33:54,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909989281] [2019-11-23 20:33:54,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965949693] [2019-11-23 20:33:54,802 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:54,885 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-23 20:33:54,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:54,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:33:54,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:33:54,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:54,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-23 20:33:54,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679542334] [2019-11-23 20:33:54,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:33:54,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:54,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:33:54,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:33:54,911 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 15 states. [2019-11-23 20:33:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:54,964 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-23 20:33:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 20:33:54,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-11-23 20:33:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:54,966 INFO L225 Difference]: With dead ends: 58 [2019-11-23 20:33:54,966 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 20:33:54,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:33:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 20:33:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-23 20:33:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 20:33:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-23 20:33:54,972 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-11-23 20:33:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:54,972 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-23 20:33:54,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:33:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-23 20:33:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:33:54,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:54,973 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:55,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:55,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 169904162, now seen corresponding path program 12 times [2019-11-23 20:33:55,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:55,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774904686] [2019-11-23 20:33:55,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:33:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774904686] [2019-11-23 20:33:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016709684] [2019-11-23 20:33:55,341 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:55,437 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-23 20:33:55,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:55,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 20:33:55,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:55,510 INFO L377 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 15 treesize of output 11 [2019-11-23 20:33:55,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:55,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:55,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:55,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:33:55,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:55,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 91 [2019-11-23 20:33:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:55,865 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-11-23 20:33:55,866 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-23 20:33:55,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:78 [2019-11-23 20:33:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:56,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-23 20:33:56,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:56,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-11-23 20:33:56,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844021781] [2019-11-23 20:33:56,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:33:56,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:33:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:33:56,121 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 27 states. [2019-11-23 20:33:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:56,756 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-23 20:33:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:33:56,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-11-23 20:33:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:56,757 INFO L225 Difference]: With dead ends: 63 [2019-11-23 20:33:56,757 INFO L226 Difference]: Without dead ends: 47 [2019-11-23 20:33:56,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=1428, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 20:33:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-23 20:33:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-23 20:33:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 20:33:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-23 20:33:56,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2019-11-23 20:33:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:56,765 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-23 20:33:56,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:33:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-23 20:33:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:33:56,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:56,766 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:56,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:56,976 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1092253629, now seen corresponding path program 13 times [2019-11-23 20:33:56,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:56,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405169243] [2019-11-23 20:33:56,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:33:57,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405169243] [2019-11-23 20:33:57,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595207761] [2019-11-23 20:33:57,117 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:57,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:33:57,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:33:57,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:57,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-11-23 20:33:57,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772155785] [2019-11-23 20:33:57,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:33:57,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:33:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:33:57,191 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2019-11-23 20:33:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:57,243 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-11-23 20:33:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:33:57,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-11-23 20:33:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:57,245 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:33:57,245 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 20:33:57,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:33:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 20:33:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-11-23 20:33:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 20:33:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-11-23 20:33:57,252 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-11-23 20:33:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:57,252 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-11-23 20:33:57,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:33:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-11-23 20:33:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:33:57,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:57,253 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:57,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:57,457 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1504407169, now seen corresponding path program 14 times [2019-11-23 20:33:57,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:57,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678577304] [2019-11-23 20:33:57,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:33:57,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678577304] [2019-11-23 20:33:57,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406729374] [2019-11-23 20:33:57,634 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:57,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:33:57,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:57,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:33:57,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:33:57,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:57,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-11-23 20:33:57,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371642927] [2019-11-23 20:33:57,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:33:57,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:57,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:33:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:33:57,761 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2019-11-23 20:33:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:57,840 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-23 20:33:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 20:33:57,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-23 20:33:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:57,841 INFO L225 Difference]: With dead ends: 68 [2019-11-23 20:33:57,841 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:33:57,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:33:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:33:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-23 20:33:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:33:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-23 20:33:57,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2019-11-23 20:33:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:57,856 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-23 20:33:57,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:33:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-23 20:33:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:33:57,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:57,858 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:58,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:58,062 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1519435071, now seen corresponding path program 15 times [2019-11-23 20:33:58,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:58,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708143381] [2019-11-23 20:33:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:33:58,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708143381] [2019-11-23 20:33:58,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114977730] [2019-11-23 20:33:58,290 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:58,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 20:33:58,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:58,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 20:33:58,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:58,440 INFO L377 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 15 treesize of output 11 [2019-11-23 20:33:58,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:58,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:58,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:58,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:33:58,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:33:58,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:33:58,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:33:58,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:33:58,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:58,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 75 [2019-11-23 20:33:58,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:58,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:58,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:58,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:58,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:58,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:58,879 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-23 20:33:58,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:43 [2019-11-23 20:33:58,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-23 20:33:59,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:59,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-11-23 20:33:59,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648909980] [2019-11-23 20:33:59,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:33:59,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:33:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:33:59,053 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 32 states. [2019-11-23 20:33:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:59,796 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-11-23 20:33:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 20:33:59,797 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 49 [2019-11-23 20:33:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:59,798 INFO L225 Difference]: With dead ends: 73 [2019-11-23 20:33:59,798 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 20:33:59,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=526, Invalid=2024, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 20:33:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 20:33:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-11-23 20:33:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 20:33:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-23 20:33:59,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2019-11-23 20:33:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:59,810 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-23 20:33:59,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:33:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-23 20:33:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:33:59,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:59,815 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:00,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:00,019 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:00,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1429883936, now seen corresponding path program 16 times [2019-11-23 20:34:00,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:00,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729910311] [2019-11-23 20:34:00,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 20:34:00,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729910311] [2019-11-23 20:34:00,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326551802] [2019-11-23 20:34:00,212 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:00,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:34:00,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:00,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:34:00,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 20:34:00,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:00,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-11-23 20:34:00,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438283272] [2019-11-23 20:34:00,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:34:00,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:34:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:34:00,278 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 20 states. [2019-11-23 20:34:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:00,342 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-23 20:34:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:34:00,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2019-11-23 20:34:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:00,344 INFO L225 Difference]: With dead ends: 76 [2019-11-23 20:34:00,344 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 20:34:00,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:34:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 20:34:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-23 20:34:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-23 20:34:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-23 20:34:00,350 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 53 [2019-11-23 20:34:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:00,350 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-23 20:34:00,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:34:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-23 20:34:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 20:34:00,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:00,351 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:00,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:00,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1085467554, now seen corresponding path program 17 times [2019-11-23 20:34:00,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:00,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274964607] [2019-11-23 20:34:00,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 20:34:00,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274964607] [2019-11-23 20:34:00,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915124235] [2019-11-23 20:34:00,745 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:01,000 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-23 20:34:01,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:01,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:34:01,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 20:34:01,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:01,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-11-23 20:34:01,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462381] [2019-11-23 20:34:01,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:34:01,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:34:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:34:01,033 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 21 states. [2019-11-23 20:34:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:01,116 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-23 20:34:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:34:01,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-11-23 20:34:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:01,119 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:34:01,119 INFO L226 Difference]: Without dead ends: 59 [2019-11-23 20:34:01,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:34:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-23 20:34:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-23 20:34:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 20:34:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-11-23 20:34:01,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 55 [2019-11-23 20:34:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:01,129 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-11-23 20:34:01,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:34:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-11-23 20:34:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:34:01,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:01,130 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:01,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:01,335 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -271661796, now seen corresponding path program 18 times [2019-11-23 20:34:01,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:01,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264742849] [2019-11-23 20:34:01,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 20:34:01,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264742849] [2019-11-23 20:34:01,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732661099] [2019-11-23 20:34:01,552 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:01,785 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-23 20:34:01,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:01,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 20:34:01,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:01,815 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:01,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:01,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:01,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:01,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:02,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:02,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 183 [2019-11-23 20:34:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:02,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:03,173 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 52 [2019-11-23 20:34:03,174 INFO L567 ElimStorePlain]: treesize reduction 2753, result has 4.4 percent of original size [2019-11-23 20:34:03,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:03,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:03,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:155 [2019-11-23 20:34:03,418 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-23 20:34:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:03,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:03,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-11-23 20:34:03,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:03,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2019-11-23 20:34:03,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890971865] [2019-11-23 20:34:03,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-23 20:34:03,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-23 20:34:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 20:34:03,725 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 37 states. [2019-11-23 20:34:04,642 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-23 20:34:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:04,764 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-23 20:34:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:34:04,764 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2019-11-23 20:34:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:04,765 INFO L225 Difference]: With dead ends: 83 [2019-11-23 20:34:04,765 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 20:34:04,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=719, Invalid=2703, Unknown=0, NotChecked=0, Total=3422 [2019-11-23 20:34:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 20:34:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-23 20:34:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 20:34:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-23 20:34:04,770 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2019-11-23 20:34:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-23 20:34:04,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-23 20:34:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-23 20:34:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:34:04,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:04,772 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:04,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:04,974 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:04,975 INFO L82 PathProgramCache]: Analyzing trace with hash -105827651, now seen corresponding path program 19 times [2019-11-23 20:34:04,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:04,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597229192] [2019-11-23 20:34:04,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 20:34:05,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597229192] [2019-11-23 20:34:05,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131702727] [2019-11-23 20:34:05,253 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:05,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:34:05,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 20:34:05,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:05,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-11-23 20:34:05,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015714921] [2019-11-23 20:34:05,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:34:05,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:05,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:34:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:34:05,333 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 23 states. [2019-11-23 20:34:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:05,390 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-11-23 20:34:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:34:05,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2019-11-23 20:34:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:05,391 INFO L225 Difference]: With dead ends: 86 [2019-11-23 20:34:05,391 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 20:34:05,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:34:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 20:34:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-11-23 20:34:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 20:34:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-11-23 20:34:05,396 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-11-23 20:34:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:05,397 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-11-23 20:34:05,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:34:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-11-23 20:34:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:34:05,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:05,398 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:05,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:05,607 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1861296901, now seen corresponding path program 20 times [2019-11-23 20:34:05,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:05,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541825903] [2019-11-23 20:34:05,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 20:34:05,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541825903] [2019-11-23 20:34:05,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565669100] [2019-11-23 20:34:05,846 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:05,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:34:05,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:05,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:34:05,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 20:34:05,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:05,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-11-23 20:34:05,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101677593] [2019-11-23 20:34:05,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:34:05,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:34:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:34:05,917 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 24 states. [2019-11-23 20:34:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:06,011 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-11-23 20:34:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:34:06,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-11-23 20:34:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:06,015 INFO L225 Difference]: With dead ends: 88 [2019-11-23 20:34:06,015 INFO L226 Difference]: Without dead ends: 67 [2019-11-23 20:34:06,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:34:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-23 20:34:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-23 20:34:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 20:34:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-11-23 20:34:06,019 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-11-23 20:34:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:06,020 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-11-23 20:34:06,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:34:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-11-23 20:34:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:34:06,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:06,021 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:06,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:06,229 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -945098823, now seen corresponding path program 21 times [2019-11-23 20:34:06,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:06,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987659216] [2019-11-23 20:34:06,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 20:34:06,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987659216] [2019-11-23 20:34:06,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404170763] [2019-11-23 20:34:06,557 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:06,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-23 20:34:06,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:06,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-23 20:34:06,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:06,736 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:06,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:06,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:06,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:06,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:07,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:07,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 163 [2019-11-23 20:34:07,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:07,729 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-23 20:34:07,730 INFO L567 ElimStorePlain]: treesize reduction 20, result has 89.0 percent of original size [2019-11-23 20:34:07,731 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-23 20:34:07,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:161 [2019-11-23 20:34:07,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:07,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:08,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:09,982 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 495 DAG size of output: 32 [2019-11-23 20:34:09,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-11-23 20:34:10,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:10,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2019-11-23 20:34:10,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739959562] [2019-11-23 20:34:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-23 20:34:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-23 20:34:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1375, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:34:10,073 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 42 states. [2019-11-23 20:34:11,111 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-11-23 20:34:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:11,258 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-11-23 20:34:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-23 20:34:11,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 65 [2019-11-23 20:34:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:11,259 INFO L225 Difference]: With dead ends: 93 [2019-11-23 20:34:11,260 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 20:34:11,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=918, Invalid=3504, Unknown=0, NotChecked=0, Total=4422 [2019-11-23 20:34:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 20:34:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-11-23 20:34:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 20:34:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-11-23 20:34:11,266 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2019-11-23 20:34:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:11,266 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-11-23 20:34:11,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-23 20:34:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-11-23 20:34:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 20:34:11,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:11,267 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:11,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:11,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash 424053786, now seen corresponding path program 22 times [2019-11-23 20:34:11,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:11,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477172944] [2019-11-23 20:34:11,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 20:34:11,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477172944] [2019-11-23 20:34:11,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796919749] [2019-11-23 20:34:11,766 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:11,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:34:11,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:11,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:34:11,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 20:34:11,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:11,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-11-23 20:34:11,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462723058] [2019-11-23 20:34:11,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:34:11,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:34:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:34:11,834 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-11-23 20:34:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:11,916 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-11-23 20:34:11,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 20:34:11,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-11-23 20:34:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:11,917 INFO L225 Difference]: With dead ends: 96 [2019-11-23 20:34:11,917 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 20:34:11,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:34:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 20:34:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-23 20:34:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 20:34:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-11-23 20:34:11,921 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-11-23 20:34:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:11,922 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-11-23 20:34:11,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:34:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-11-23 20:34:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 20:34:11,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:11,923 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:12,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:12,126 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1575819352, now seen corresponding path program 23 times [2019-11-23 20:34:12,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:12,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2858126] [2019-11-23 20:34:12,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 20:34:12,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2858126] [2019-11-23 20:34:12,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123187584] [2019-11-23 20:34:12,440 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:12,724 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-23 20:34:12,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:12,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:34:12,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 20:34:12,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:12,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-11-23 20:34:12,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86740256] [2019-11-23 20:34:12,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:34:12,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:34:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:34:12,741 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 27 states. [2019-11-23 20:34:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:12,841 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-11-23 20:34:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:34:12,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2019-11-23 20:34:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:12,842 INFO L225 Difference]: With dead ends: 98 [2019-11-23 20:34:12,842 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 20:34:12,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:34:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 20:34:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-11-23 20:34:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-23 20:34:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-23 20:34:12,846 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-11-23 20:34:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:12,846 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-23 20:34:12,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:34:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-23 20:34:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 20:34:12,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:12,847 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:13,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:13,052 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 320965910, now seen corresponding path program 24 times [2019-11-23 20:34:13,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:13,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658756235] [2019-11-23 20:34:13,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 20:34:13,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658756235] [2019-11-23 20:34:13,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163724177] [2019-11-23 20:34:13,365 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:13,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-23 20:34:13,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:13,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-23 20:34:13,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:13,903 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:13,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:13,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:13,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:13,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:14,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:14,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:14,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 75 treesize of output 117 [2019-11-23 20:34:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:14,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:14,792 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-23 20:34:14,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:61 [2019-11-23 20:34:14,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-23 20:34:15,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:15,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2019-11-23 20:34:15,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416708560] [2019-11-23 20:34:15,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-23 20:34:15,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-23 20:34:15,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=1733, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 20:34:15,587 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 47 states. [2019-11-23 20:34:17,152 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-11-23 20:34:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:17,404 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-11-23 20:34:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:34:17,405 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 73 [2019-11-23 20:34:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:17,406 INFO L225 Difference]: With dead ends: 103 [2019-11-23 20:34:17,406 INFO L226 Difference]: Without dead ends: 79 [2019-11-23 20:34:17,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1147, Invalid=4403, Unknown=0, NotChecked=0, Total=5550 [2019-11-23 20:34:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-23 20:34:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-11-23 20:34:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 20:34:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-11-23 20:34:17,414 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 73 [2019-11-23 20:34:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:17,414 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-11-23 20:34:17,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-23 20:34:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-11-23 20:34:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 20:34:17,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:17,415 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:17,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:17,620 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash 958572599, now seen corresponding path program 25 times [2019-11-23 20:34:17,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:17,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93581125] [2019-11-23 20:34:17,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:34:17,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93581125] [2019-11-23 20:34:17,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109986219] [2019-11-23 20:34:17,985 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:18,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:34:18,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:34:18,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:18,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-11-23 20:34:18,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125462895] [2019-11-23 20:34:18,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:34:18,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:34:18,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:34:18,064 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 29 states. [2019-11-23 20:34:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:18,152 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-11-23 20:34:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:34:18,153 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2019-11-23 20:34:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:18,153 INFO L225 Difference]: With dead ends: 106 [2019-11-23 20:34:18,154 INFO L226 Difference]: Without dead ends: 81 [2019-11-23 20:34:18,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:34:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-23 20:34:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-11-23 20:34:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 20:34:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-23 20:34:18,158 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-11-23 20:34:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:18,159 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-23 20:34:18,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:34:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-23 20:34:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 20:34:18,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:18,160 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:18,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:18,363 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -854583691, now seen corresponding path program 26 times [2019-11-23 20:34:18,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:18,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744954609] [2019-11-23 20:34:18,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:34:18,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744954609] [2019-11-23 20:34:18,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284126480] [2019-11-23 20:34:18,723 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:18,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:34:18,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:18,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:34:18,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:34:18,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:18,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-11-23 20:34:18,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569895262] [2019-11-23 20:34:18,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 20:34:18,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 20:34:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:34:18,800 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 30 states. [2019-11-23 20:34:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:18,908 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-11-23 20:34:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 20:34:18,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2019-11-23 20:34:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:18,913 INFO L225 Difference]: With dead ends: 108 [2019-11-23 20:34:18,913 INFO L226 Difference]: Without dead ends: 83 [2019-11-23 20:34:18,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:34:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-23 20:34:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-11-23 20:34:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 20:34:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-11-23 20:34:18,917 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 79 [2019-11-23 20:34:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-11-23 20:34:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 20:34:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-11-23 20:34:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 20:34:18,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:18,919 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:19,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:19,122 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 458943795, now seen corresponding path program 27 times [2019-11-23 20:34:19,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:19,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948121822] [2019-11-23 20:34:19,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:34:19,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948121822] [2019-11-23 20:34:19,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914357984] [2019-11-23 20:34:19,481 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:19,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 20:34:19,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:19,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 20:34:19,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:19,682 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:19,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:19,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:19,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:19,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:20,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:20,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:20,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 163 [2019-11-23 20:34:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:20,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:20,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:20,965 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-23 20:34:20,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:99 [2019-11-23 20:34:21,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-11-23 20:34:22,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:22,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2019-11-23 20:34:22,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323661787] [2019-11-23 20:34:22,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-23 20:34:22,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-23 20:34:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=2130, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 20:34:22,302 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 52 states. [2019-11-23 20:34:23,816 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-11-23 20:34:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:24,099 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-11-23 20:34:24,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-23 20:34:24,100 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 81 [2019-11-23 20:34:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:24,100 INFO L225 Difference]: With dead ends: 113 [2019-11-23 20:34:24,100 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 20:34:24,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1676 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1408, Invalid=5398, Unknown=0, NotChecked=0, Total=6806 [2019-11-23 20:34:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 20:34:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-11-23 20:34:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-23 20:34:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-23 20:34:24,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 81 [2019-11-23 20:34:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:24,108 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-23 20:34:24,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-23 20:34:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-23 20:34:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 20:34:24,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:24,109 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:24,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:24,313 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1684416748, now seen corresponding path program 28 times [2019-11-23 20:34:24,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:24,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713804101] [2019-11-23 20:34:24,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 20:34:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713804101] [2019-11-23 20:34:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016647040] [2019-11-23 20:34:24,698 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:24,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:34:24,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:24,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:34:24,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 20:34:24,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:24,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-11-23 20:34:24,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615088683] [2019-11-23 20:34:24,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:34:24,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:34:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:34:24,795 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 32 states. [2019-11-23 20:34:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:24,904 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-11-23 20:34:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:34:24,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 85 [2019-11-23 20:34:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:24,905 INFO L225 Difference]: With dead ends: 116 [2019-11-23 20:34:24,905 INFO L226 Difference]: Without dead ends: 89 [2019-11-23 20:34:24,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:34:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-23 20:34:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-11-23 20:34:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-23 20:34:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-11-23 20:34:24,911 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-11-23 20:34:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:24,912 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-11-23 20:34:24,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:34:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-11-23 20:34:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-23 20:34:24,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:24,913 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:25,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:25,116 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1120675666, now seen corresponding path program 29 times [2019-11-23 20:34:25,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:25,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905160226] [2019-11-23 20:34:25,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 20:34:25,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905160226] [2019-11-23 20:34:25,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076253801] [2019-11-23 20:34:25,710 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:26,672 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-11-23 20:34:26,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:26,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:34:26,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 20:34:26,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:26,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-11-23 20:34:26,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553236845] [2019-11-23 20:34:26,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:34:26,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:34:26,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:34:26,709 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 33 states. [2019-11-23 20:34:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:26,818 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-11-23 20:34:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 20:34:26,819 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2019-11-23 20:34:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:26,819 INFO L225 Difference]: With dead ends: 118 [2019-11-23 20:34:26,819 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 20:34:26,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:34:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 20:34:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-11-23 20:34:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 20:34:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-11-23 20:34:26,824 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2019-11-23 20:34:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:26,824 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-11-23 20:34:26,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:34:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-11-23 20:34:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 20:34:26,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:26,825 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:27,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:27,031 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash -424976368, now seen corresponding path program 30 times [2019-11-23 20:34:27,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:27,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168539061] [2019-11-23 20:34:27,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 20:34:27,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168539061] [2019-11-23 20:34:27,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009764519] [2019-11-23 20:34:27,465 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:28,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-11-23 20:34:28,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:28,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-23 20:34:28,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:28,606 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:28,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:28,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:28,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:28,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:30,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:30,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:30,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 119 treesize of output 173 [2019-11-23 20:34:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:30,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:30,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:30,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:101 [2019-11-23 20:34:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:30,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-11-23 20:34:32,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:32,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 61 [2019-11-23 20:34:32,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396678782] [2019-11-23 20:34:32,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-23 20:34:32,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-23 20:34:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=2906, Unknown=0, NotChecked=0, Total=3660 [2019-11-23 20:34:32,291 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 61 states. [2019-11-23 20:34:34,077 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-11-23 20:34:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:34,359 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2019-11-23 20:34:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-23 20:34:34,359 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 89 [2019-11-23 20:34:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:34,360 INFO L225 Difference]: With dead ends: 123 [2019-11-23 20:34:34,360 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 20:34:34,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2314 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1690, Invalid=6500, Unknown=0, NotChecked=0, Total=8190 [2019-11-23 20:34:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 20:34:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-11-23 20:34:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-23 20:34:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-11-23 20:34:34,368 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2019-11-23 20:34:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:34,369 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-11-23 20:34:34,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-23 20:34:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-11-23 20:34:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 20:34:34,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:34,370 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:34,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:34,575 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1523816271, now seen corresponding path program 31 times [2019-11-23 20:34:34,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:34,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54802285] [2019-11-23 20:34:34,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-23 20:34:35,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54802285] [2019-11-23 20:34:35,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480461193] [2019-11-23 20:34:35,193 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:35,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:34:35,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-23 20:34:35,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:35,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-11-23 20:34:35,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105933400] [2019-11-23 20:34:35,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-23 20:34:35,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-23 20:34:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:34:35,280 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 35 states. [2019-11-23 20:34:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:35,397 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-11-23 20:34:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 20:34:35,398 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 93 [2019-11-23 20:34:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:35,398 INFO L225 Difference]: With dead ends: 126 [2019-11-23 20:34:35,398 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 20:34:35,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:34:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 20:34:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-11-23 20:34:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 20:34:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-11-23 20:34:35,403 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-11-23 20:34:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:35,403 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-11-23 20:34:35,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-23 20:34:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-11-23 20:34:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 20:34:35,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:35,404 INFO L410 BasicCegarLoop]: trace histogram [32, 32, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:35,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:35,607 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1168218863, now seen corresponding path program 32 times [2019-11-23 20:34:35,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:35,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966016112] [2019-11-23 20:34:35,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-23 20:34:36,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966016112] [2019-11-23 20:34:36,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330699172] [2019-11-23 20:34:36,401 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:36,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:34:36,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:36,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:34:36,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-23 20:34:36,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:36,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-11-23 20:34:36,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582872090] [2019-11-23 20:34:36,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 20:34:36,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 20:34:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:34:36,543 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 36 states. [2019-11-23 20:34:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:36,698 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-11-23 20:34:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 20:34:36,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2019-11-23 20:34:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:36,700 INFO L225 Difference]: With dead ends: 128 [2019-11-23 20:34:36,700 INFO L226 Difference]: Without dead ends: 99 [2019-11-23 20:34:36,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:34:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-23 20:34:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-23 20:34:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-23 20:34:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-11-23 20:34:36,708 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2019-11-23 20:34:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:36,709 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-11-23 20:34:36,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-23 20:34:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-11-23 20:34:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 20:34:36,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:36,710 INFO L410 BasicCegarLoop]: trace histogram [33, 33, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:36,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:36,915 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1651296851, now seen corresponding path program 33 times [2019-11-23 20:34:36,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:36,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489782885] [2019-11-23 20:34:36,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-23 20:34:37,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489782885] [2019-11-23 20:34:37,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329537967] [2019-11-23 20:34:37,440 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:37,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-11-23 20:34:37,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:37,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-23 20:34:37,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:37,644 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:37,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:37,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:37,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:37,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:39,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:39,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:39,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 55 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 103 treesize of output 163 [2019-11-23 20:34:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:39,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:39,320 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-23 20:34:39,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:109, output treesize:83 [2019-11-23 20:34:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:39,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-11-23 20:34:43,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:43,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 28] total 62 [2019-11-23 20:34:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349663814] [2019-11-23 20:34:43,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-23 20:34:43,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-23 20:34:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:34:43,435 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 62 states. [2019-11-23 20:34:45,417 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-11-23 20:34:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:45,724 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-11-23 20:34:45,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-23 20:34:45,725 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 97 [2019-11-23 20:34:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:45,726 INFO L225 Difference]: With dead ends: 133 [2019-11-23 20:34:45,726 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 20:34:45,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2011, Invalid=7691, Unknown=0, NotChecked=0, Total=9702 [2019-11-23 20:34:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 20:34:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-11-23 20:34:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-23 20:34:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-11-23 20:34:45,733 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2019-11-23 20:34:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:45,733 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-11-23 20:34:45,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-23 20:34:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-11-23 20:34:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 20:34:45,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:45,734 INFO L410 BasicCegarLoop]: trace histogram [34, 34, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:45,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:45,938 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 25603342, now seen corresponding path program 34 times [2019-11-23 20:34:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:45,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023083988] [2019-11-23 20:34:45,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-23 20:34:46,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023083988] [2019-11-23 20:34:46,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323072197] [2019-11-23 20:34:46,705 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:46,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:34:46,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:46,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 20:34:46,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-23 20:34:46,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:46,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-11-23 20:34:46,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408952277] [2019-11-23 20:34:46,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:34:46,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:34:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:34:46,840 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 38 states. [2019-11-23 20:34:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:47,030 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-11-23 20:34:47,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:34:47,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 101 [2019-11-23 20:34:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:47,032 INFO L225 Difference]: With dead ends: 136 [2019-11-23 20:34:47,032 INFO L226 Difference]: Without dead ends: 105 [2019-11-23 20:34:47,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:34:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-23 20:34:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-11-23 20:34:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 20:34:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-11-23 20:34:47,042 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-11-23 20:34:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:47,042 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-11-23 20:34:47,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:34:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-11-23 20:34:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 20:34:47,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:47,044 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:47,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:47,249 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1556299444, now seen corresponding path program 35 times [2019-11-23 20:34:47,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:47,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735764321] [2019-11-23 20:34:47,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-23 20:34:48,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735764321] [2019-11-23 20:34:48,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238013348] [2019-11-23 20:34:48,015 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:49,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-11-23 20:34:49,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:49,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:34:49,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-23 20:34:49,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:34:49,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-11-23 20:34:49,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927876563] [2019-11-23 20:34:49,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-23 20:34:49,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:34:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-23 20:34:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:34:49,167 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 39 states. [2019-11-23 20:34:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:34:49,301 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-11-23 20:34:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 20:34:49,302 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2019-11-23 20:34:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:34:49,303 INFO L225 Difference]: With dead ends: 138 [2019-11-23 20:34:49,303 INFO L226 Difference]: Without dead ends: 107 [2019-11-23 20:34:49,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:34:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-23 20:34:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-23 20:34:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 20:34:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-11-23 20:34:49,312 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 103 [2019-11-23 20:34:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:34:49,313 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-11-23 20:34:49,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-23 20:34:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-11-23 20:34:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 20:34:49,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:34:49,314 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:34:49,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:49,523 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:34:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:34:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1346454006, now seen corresponding path program 36 times [2019-11-23 20:34:49,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:34:49,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683615709] [2019-11-23 20:34:49,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:34:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:34:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-23 20:34:50,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683615709] [2019-11-23 20:34:50,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285695110] [2019-11-23 20:34:50,525 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:34:51,702 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-23 20:34:51,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:34:51,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-23 20:34:51,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:34:51,748 INFO L377 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 15 treesize of output 11 [2019-11-23 20:34:51,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:51,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:51,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:34:51,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:34:53,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:34:53,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:53,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 66 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 123 treesize of output 189 [2019-11-23 20:34:53,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:53,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:34:53,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:34:53,841 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-23 20:34:53,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:129, output treesize:101 [2019-11-23 20:34:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:34:54,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-11-23 20:35:01,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:35:01,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 30] total 67 [2019-11-23 20:35:01,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984599540] [2019-11-23 20:35:01,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-23 20:35:01,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:35:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-23 20:35:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=3567, Unknown=0, NotChecked=0, Total=4422 [2019-11-23 20:35:01,917 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 67 states. [2019-11-23 20:35:03,959 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-11-23 20:35:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:35:04,265 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2019-11-23 20:35:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-23 20:35:04,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 105 [2019-11-23 20:35:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:35:04,267 INFO L225 Difference]: With dead ends: 143 [2019-11-23 20:35:04,267 INFO L226 Difference]: Without dead ends: 111 [2019-11-23 20:35:04,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2353, Invalid=8989, Unknown=0, NotChecked=0, Total=11342 [2019-11-23 20:35:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-23 20:35:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-11-23 20:35:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-23 20:35:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-11-23 20:35:04,275 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 105 [2019-11-23 20:35:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:35:04,276 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-11-23 20:35:04,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-23 20:35:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-11-23 20:35:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 20:35:04,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:35:04,277 INFO L410 BasicCegarLoop]: trace histogram [37, 37, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:35:04,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:04,482 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:35:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:35:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2004814805, now seen corresponding path program 37 times [2019-11-23 20:35:04,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:35:04,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525773613] [2019-11-23 20:35:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:35:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:35:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:35:05,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525773613] [2019-11-23 20:35:05,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420020756] [2019-11-23 20:35:05,090 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:35:05,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:35:05,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:35:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:35:05,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:35:05,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-11-23 20:35:05,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620843950] [2019-11-23 20:35:05,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-23 20:35:05,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:35:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-23 20:35:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 20:35:05,182 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 41 states. [2019-11-23 20:35:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:35:05,319 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2019-11-23 20:35:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-23 20:35:05,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2019-11-23 20:35:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:35:05,320 INFO L225 Difference]: With dead ends: 146 [2019-11-23 20:35:05,320 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 20:35:05,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 20:35:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 20:35:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-11-23 20:35:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-23 20:35:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-11-23 20:35:05,327 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-11-23 20:35:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:35:05,327 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-11-23 20:35:05,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-23 20:35:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-11-23 20:35:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 20:35:05,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:35:05,328 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:35:05,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:05,532 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:35:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:35:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1433791081, now seen corresponding path program 38 times [2019-11-23 20:35:05,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:35:05,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075598037] [2019-11-23 20:35:05,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:35:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:35:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1626 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:35:06,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075598037] [2019-11-23 20:35:06,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656059704] [2019-11-23 20:35:06,148 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:06,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:35:06,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:35:06,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 20:35:06,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:35:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1626 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:35:06,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:35:06,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-11-23 20:35:06,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40587167] [2019-11-23 20:35:06,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-23 20:35:06,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:35:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-23 20:35:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:35:06,247 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2019-11-23 20:35:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:35:06,402 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-11-23 20:35:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 20:35:06,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2019-11-23 20:35:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:35:06,403 INFO L225 Difference]: With dead ends: 148 [2019-11-23 20:35:06,403 INFO L226 Difference]: Without dead ends: 115 [2019-11-23 20:35:06,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:35:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-23 20:35:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-23 20:35:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 20:35:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-11-23 20:35:06,413 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-11-23 20:35:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:35:06,413 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-11-23 20:35:06,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-23 20:35:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-11-23 20:35:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 20:35:06,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:35:06,414 INFO L410 BasicCegarLoop]: trace histogram [39, 39, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:35:06,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:06,618 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:35:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:35:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1190770393, now seen corresponding path program 39 times [2019-11-23 20:35:06,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:35:06,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057364416] [2019-11-23 20:35:06,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:35:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:35:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:35:07,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057364416] [2019-11-23 20:35:07,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175577450] [2019-11-23 20:35:07,270 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:35:07,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-23 20:35:07,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:35:07,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-23 20:35:07,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:35:07,579 INFO L377 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 15 treesize of output 11 [2019-11-23 20:35:07,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:35:07,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:35:07,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:35:07,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:35:09,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:35:09,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:35:09,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 115 treesize of output 187 [2019-11-23 20:35:09,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:09,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:35:09,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:35:09,982 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-23 20:35:09,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:91 [2019-11-23 20:35:10,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:35:10,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms