/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-tiling/pnr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:46:36,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:36,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:36,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:36,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:36,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:36,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:36,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:36,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:36,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:36,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:36,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:36,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:36,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:36,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:36,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:36,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:36,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:36,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:36,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:36,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:36,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:36,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:36,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:36,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:36,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:36,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:36,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:36,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:36,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:36,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:36,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:36,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:36,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:36,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:36,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:36,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:36,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:36,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:36,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:36,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:36,356 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:46:36,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:36,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:36,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:36,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:36,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:36,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:36,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:36,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:36,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:36,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:36,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:36,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:36,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:36,383 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:36,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:36,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:36,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:36,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:36,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:36,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:36,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:36,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:36,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:36,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:36,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:36,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:36,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:36,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:36,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:36,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:36,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:36,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:36,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:36,690 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:36,690 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:36,691 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr3.c [2019-11-23 20:46:36,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88620b06a/d796aa519953407399cdb98d15f3fc9a/FLAGfa555a608 [2019-11-23 20:46:37,213 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:37,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3.c [2019-11-23 20:46:37,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88620b06a/d796aa519953407399cdb98d15f3fc9a/FLAGfa555a608 [2019-11-23 20:46:37,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88620b06a/d796aa519953407399cdb98d15f3fc9a [2019-11-23 20:46:37,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:37,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:37,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:37,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:37,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:37,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:37,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a736ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37, skipping insertion in model container [2019-11-23 20:46:37,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:37,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:37,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:37,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:37,855 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:37,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:37,889 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37 WrapperNode [2019-11-23 20:46:37,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:37,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:37,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:37,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:37,897 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:46:37" (1/1) ... [2019-11-23 20:46:37,988 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:46:37" (1/1) ... [2019-11-23 20:46:38,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:38,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:38,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:38,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:38,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (1/1) ... [2019-11-23 20:46:38,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:38,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:38,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:38,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:38,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (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:46:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:46:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:38,417 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:38,418 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-23 20:46:38,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:38 BoogieIcfgContainer [2019-11-23 20:46:38,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:38,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:38,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:38,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:38,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:37" (1/3) ... [2019-11-23 20:46:38,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bba01a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:38, skipping insertion in model container [2019-11-23 20:46:38,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:37" (2/3) ... [2019-11-23 20:46:38,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bba01a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:38, skipping insertion in model container [2019-11-23 20:46:38,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:38" (3/3) ... [2019-11-23 20:46:38,437 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr3.c [2019-11-23 20:46:38,451 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:38,457 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:38,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:38,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:38,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:38,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:38,497 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:38,498 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:38,498 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:38,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:38,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-23 20:46:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:46:38,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:38,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:38,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash -560724718, now seen corresponding path program 1 times [2019-11-23 20:46:38,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:38,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702454029] [2019-11-23 20:46:38,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,934 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:46:38,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702454029] [2019-11-23 20:46:38,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:38,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:38,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527593932] [2019-11-23 20:46:38,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:38,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:38,959 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-23 20:46:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:39,066 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-23 20:46:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:39,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-23 20:46:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:39,078 INFO L225 Difference]: With dead ends: 50 [2019-11-23 20:46:39,078 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:46:39,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:46:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-11-23 20:46:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:46:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:46:39,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-11-23 20:46:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:39,122 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:46:39,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:46:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:46:39,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:39,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:39,124 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2060562691, now seen corresponding path program 1 times [2019-11-23 20:46:39,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:39,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754994957] [2019-11-23 20:46:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:39,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754994957] [2019-11-23 20:46:39,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069007044] [2019-11-23 20:46:39,477 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:46:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:39,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:46:39,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:46:39,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,658 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:46:39,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:46:39,730 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:39,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:46:39,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,739 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:46:39,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:46:39,766 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:46:39,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-11-23 20:46:39,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,777 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:46:39,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-11-23 20:46:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:39,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:39,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-23 20:46:39,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330178078] [2019-11-23 20:46:39,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:46:39,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:46:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:46:39,839 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 13 states. [2019-11-23 20:46:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:40,153 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2019-11-23 20:46:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:46:40,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-11-23 20:46:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:40,155 INFO L225 Difference]: With dead ends: 68 [2019-11-23 20:46:40,155 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 20:46:40,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:46:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 20:46:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2019-11-23 20:46:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 20:46:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-23 20:46:40,170 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 19 [2019-11-23 20:46:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:40,171 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-23 20:46:40,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:46:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-23 20:46:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:46:40,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:40,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:40,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:40,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1473756677, now seen corresponding path program 1 times [2019-11-23 20:46:40,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:40,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401061035] [2019-11-23 20:46:40,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:40,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401061035] [2019-11-23 20:46:40,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741482467] [2019-11-23 20:46:40,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:40,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:46:40,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:40,784 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 16 treesize of output 12 [2019-11-23 20:46:40,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:40,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:40,796 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:46:40,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:40,834 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:40,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:46:40,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:40,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:40,847 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:46:40,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:46:40,866 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:46:40,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-23 20:46:40,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:40,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:40,878 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:46:40,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:46:40,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:40,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:40,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-23 20:46:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841158841] [2019-11-23 20:46:40,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:46:40,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:40,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:46:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:46:40,947 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 14 states. [2019-11-23 20:46:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:41,852 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2019-11-23 20:46:41,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:46:41,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-23 20:46:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:41,857 INFO L225 Difference]: With dead ends: 90 [2019-11-23 20:46:41,858 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 20:46:41,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:46:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 20:46:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 24. [2019-11-23 20:46:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 20:46:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-23 20:46:41,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2019-11-23 20:46:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:41,867 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-23 20:46:41,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:46:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-23 20:46:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:41,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:41,868 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:42,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:42,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1906991929, now seen corresponding path program 1 times [2019-11-23 20:46:42,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:42,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297992288] [2019-11-23 20:46:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:42,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297992288] [2019-11-23 20:46:42,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119535559] [2019-11-23 20:46:42,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:46:42,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:42,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:46:42,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:42,255 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:46:42,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:46:42,268 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:46:42,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:46:42,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:42,275 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:46:42,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-23 20:46:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:42,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:42,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-23 20:46:42,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413873875] [2019-11-23 20:46:42,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 20:46:42,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 20:46:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:46:42,307 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2019-11-23 20:46:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:42,483 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-23 20:46:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:46:42,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-23 20:46:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:42,485 INFO L225 Difference]: With dead ends: 65 [2019-11-23 20:46:42,485 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 20:46:42,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:46:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 20:46:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-11-23 20:46:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 20:46:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-11-23 20:46:42,504 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 23 [2019-11-23 20:46:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:42,505 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-23 20:46:42,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 20:46:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-11-23 20:46:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:42,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:42,508 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:42,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:42,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 895874679, now seen corresponding path program 1 times [2019-11-23 20:46:42,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:42,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791634600] [2019-11-23 20:46:42,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:42,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791634600] [2019-11-23 20:46:42,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560275869] [2019-11-23 20:46:42,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:46:42,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:42,995 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 16 treesize of output 12 [2019-11-23 20:46:42,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:43,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:43,007 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:46:43,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:43,034 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:46:43,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:46:43,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:43,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:43,041 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:46:43,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:46:43,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:43,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:46:43,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907479660] [2019-11-23 20:46:43,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:46:43,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:46:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:46:43,113 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 15 states. [2019-11-23 20:46:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:43,887 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-11-23 20:46:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:46:43,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-23 20:46:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:43,889 INFO L225 Difference]: With dead ends: 89 [2019-11-23 20:46:43,889 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 20:46:43,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:46:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 20:46:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 28. [2019-11-23 20:46:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:46:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-23 20:46:43,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2019-11-23 20:46:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:43,897 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-23 20:46:43,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:46:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-23 20:46:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:46:43,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:43,898 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:44,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:44,104 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash 198380143, now seen corresponding path program 2 times [2019-11-23 20:46:44,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:44,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537095571] [2019-11-23 20:46:44,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:44,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537095571] [2019-11-23 20:46:44,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604164180] [2019-11-23 20:46:44,209 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:44,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:44,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:44,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:46:44,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:44,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:44,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,303 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:46:44,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:46:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:44,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:44,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-23 20:46:44,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227283787] [2019-11-23 20:46:44,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:46:44,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:46:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:46:44,392 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2019-11-23 20:46:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:44,887 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-11-23 20:46:44,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:46:44,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-23 20:46:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:44,889 INFO L225 Difference]: With dead ends: 105 [2019-11-23 20:46:44,889 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 20:46:44,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:46:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 20:46:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2019-11-23 20:46:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 20:46:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2019-11-23 20:46:44,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2019-11-23 20:46:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-11-23 20:46:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:46:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2019-11-23 20:46:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:46:44,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:44,916 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:45,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:45,120 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1081483535, now seen corresponding path program 1 times [2019-11-23 20:46:45,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:45,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691158046] [2019-11-23 20:46:45,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:45,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691158046] [2019-11-23 20:46:45,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240280345] [2019-11-23 20:46:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:46:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:45,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:46:45,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:45,358 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 13 treesize of output 9 [2019-11-23 20:46:45,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:45,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:45,365 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:46:45,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:46:45,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:45,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:45,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-23 20:46:45,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664194266] [2019-11-23 20:46:45,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:46:45,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:46:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:46:45,455 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 17 states. [2019-11-23 20:46:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:46,648 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-11-23 20:46:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 20:46:46,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-11-23 20:46:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:46,650 INFO L225 Difference]: With dead ends: 132 [2019-11-23 20:46:46,652 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 20:46:46,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 20:46:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 20:46:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 32. [2019-11-23 20:46:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 20:46:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-23 20:46:46,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2019-11-23 20:46:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:46,666 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-23 20:46:46,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:46:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-23 20:46:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:46:46,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:46,667 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:46,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:46,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:46,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2042026331, now seen corresponding path program 3 times [2019-11-23 20:46:46,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:46,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210869852] [2019-11-23 20:46:46,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:47,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210869852] [2019-11-23 20:46:47,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288938579] [2019-11-23 20:46:47,187 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 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:46:47,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:46:47,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:47,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:46:47,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:47,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:46:47,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:47,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-23 20:46:47,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476590868] [2019-11-23 20:46:47,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:46:47,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:46:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:46:47,420 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 17 states. [2019-11-23 20:46:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:47,630 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-11-23 20:46:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:46:47,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-11-23 20:46:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:47,631 INFO L225 Difference]: With dead ends: 71 [2019-11-23 20:46:47,631 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:46:47,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:46:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:46:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-23 20:46:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 20:46:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-11-23 20:46:47,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 31 [2019-11-23 20:46:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:47,639 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-23 20:46:47,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:46:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-11-23 20:46:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:47,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:47,640 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:47,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:47,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:47,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1596598314, now seen corresponding path program 4 times [2019-11-23 20:46:47,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:47,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900374646] [2019-11-23 20:46:47,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:48,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900374646] [2019-11-23 20:46:48,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32635383] [2019-11-23 20:46:48,019 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 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:46:48,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:46:48,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:48,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:46:48,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:48,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:46:48,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:48,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:48,138 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:46:48,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-23 20:46:48,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:48,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:46:48,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:48,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:48,176 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:46:48,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-11-23 20:46:48,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:48,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:46:48,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:48,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:48,202 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:46:48,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-23 20:46:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:48,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:48,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-23 20:46:48,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428141613] [2019-11-23 20:46:48,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:46:48,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:46:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:46:48,326 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 20 states. [2019-11-23 20:46:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:49,242 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2019-11-23 20:46:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:46:49,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-23 20:46:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:49,244 INFO L225 Difference]: With dead ends: 188 [2019-11-23 20:46:49,244 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 20:46:49,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 20:46:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 20:46:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 69. [2019-11-23 20:46:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 20:46:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-23 20:46:49,258 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 41 [2019-11-23 20:46:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:49,258 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-23 20:46:49,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:46:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-23 20:46:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:49,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:49,260 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:49,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:49,464 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1456049704, now seen corresponding path program 1 times [2019-11-23 20:46:49,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:49,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544380060] [2019-11-23 20:46:49,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:49,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544380060] [2019-11-23 20:46:49,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297781763] [2019-11-23 20:46:49,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:46:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:49,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:46:49,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:49,933 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 16 treesize of output 12 [2019-11-23 20:46:49,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:49,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:49,942 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:46:49,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:49,977 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:49,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:46:49,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:49,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:49,987 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:46:49,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:46:50,002 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:46:50,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:46:50,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,011 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:46:50,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:46:50,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-23 20:46:50,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317575573] [2019-11-23 20:46:50,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:46:50,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:46:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:46:50,148 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 21 states. [2019-11-23 20:46:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:52,024 INFO L93 Difference]: Finished difference Result 177 states and 216 transitions. [2019-11-23 20:46:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:46:52,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-11-23 20:46:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:52,026 INFO L225 Difference]: With dead ends: 177 [2019-11-23 20:46:52,027 INFO L226 Difference]: Without dead ends: 175 [2019-11-23 20:46:52,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 20:46:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-23 20:46:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 46. [2019-11-23 20:46:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 20:46:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-23 20:46:52,036 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 41 [2019-11-23 20:46:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:52,037 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-23 20:46:52,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:46:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-23 20:46:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:46:52,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:52,038 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:52,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:52,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 415819916, now seen corresponding path program 5 times [2019-11-23 20:46:52,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:52,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772088477] [2019-11-23 20:46:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:52,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772088477] [2019-11-23 20:46:52,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432751769] [2019-11-23 20:46:52,384 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 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:46:52,449 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:46:52,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:52,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:46:52,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:52,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:46:52,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:52,490 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:46:52,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:46:52,509 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:52,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:46:52,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:52,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:52,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-11-23 20:46:52,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:52,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:52,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-11-23 20:46:52,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817961754] [2019-11-23 20:46:52,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:46:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:46:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:46:52,636 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 16 states. [2019-11-23 20:46:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:54,324 INFO L93 Difference]: Finished difference Result 359 states and 453 transitions. [2019-11-23 20:46:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-23 20:46:54,325 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-11-23 20:46:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:54,328 INFO L225 Difference]: With dead ends: 359 [2019-11-23 20:46:54,328 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 20:46:54,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=460, Invalid=3322, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:46:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 20:46:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 86. [2019-11-23 20:46:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-23 20:46:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2019-11-23 20:46:54,351 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 45 [2019-11-23 20:46:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:54,351 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2019-11-23 20:46:54,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:46:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2019-11-23 20:46:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:46:54,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:54,353 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:54,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:54,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash 477859530, now seen corresponding path program 1 times [2019-11-23 20:46:54,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:54,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750884984] [2019-11-23 20:46:54,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:54,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750884984] [2019-11-23 20:46:54,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308549256] [2019-11-23 20:46:54,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:46:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:54,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:46:54,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:54,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 16 treesize of output 12 [2019-11-23 20:46:54,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:54,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:54,913 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:46:54,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:54,949 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:46:54,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:46:54,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:54,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:54,955 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:46:54,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:46:55,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:55,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:55,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-11-23 20:46:55,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809945497] [2019-11-23 20:46:55,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:46:55,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:46:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:46:55,103 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 23 states. [2019-11-23 20:46:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:57,984 INFO L93 Difference]: Finished difference Result 244 states and 297 transitions. [2019-11-23 20:46:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-23 20:46:57,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-23 20:46:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:57,987 INFO L225 Difference]: With dead ends: 244 [2019-11-23 20:46:57,987 INFO L226 Difference]: Without dead ends: 242 [2019-11-23 20:46:57,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=844, Invalid=4706, Unknown=0, NotChecked=0, Total=5550 [2019-11-23 20:46:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-23 20:46:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 50. [2019-11-23 20:46:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:46:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-23 20:46:58,001 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 45 [2019-11-23 20:46:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:58,001 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-23 20:46:58,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:46:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-23 20:46:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:46:58,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:58,002 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:58,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:58,206 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1253617218, now seen corresponding path program 6 times [2019-11-23 20:46:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:58,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955798734] [2019-11-23 20:46:58,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:58,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955798734] [2019-11-23 20:46:58,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744747965] [2019-11-23 20:46:58,343 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:46:58,404 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:46:58,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:58,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:46:58,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:58,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:58,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:58,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:58,469 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:46:58,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-23 20:46:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:58,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:58,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-23 20:46:58,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810844794] [2019-11-23 20:46:58,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:46:58,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:46:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:46:58,635 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 24 states. [2019-11-23 20:47:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:01,797 INFO L93 Difference]: Finished difference Result 514 states and 644 transitions. [2019-11-23 20:47:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-11-23 20:47:01,798 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2019-11-23 20:47:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:01,802 INFO L225 Difference]: With dead ends: 514 [2019-11-23 20:47:01,802 INFO L226 Difference]: Without dead ends: 512 [2019-11-23 20:47:01,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3943 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1206, Invalid=9714, Unknown=0, NotChecked=0, Total=10920 [2019-11-23 20:47:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-23 20:47:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 103. [2019-11-23 20:47:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-23 20:47:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2019-11-23 20:47:01,828 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 49 [2019-11-23 20:47:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:01,828 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2019-11-23 20:47:01,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:47:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2019-11-23 20:47:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:47:01,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:01,830 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:02,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:02,030 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1118122044, now seen corresponding path program 1 times [2019-11-23 20:47:02,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:02,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690340851] [2019-11-23 20:47:02,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:02,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690340851] [2019-11-23 20:47:02,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146438558] [2019-11-23 20:47:02,256 INFO L94 rtionOrderModulation]: Keeping assertion order 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:47:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:02,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:47:02,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:02,393 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 13 treesize of output 9 [2019-11-23 20:47:02,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:02,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:02,398 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:47:02,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:47:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:02,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:02,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-23 20:47:02,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546654711] [2019-11-23 20:47:02,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:47:02,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:47:02,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:47:02,952 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand 25 states. [2019-11-23 20:47:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:06,800 INFO L93 Difference]: Finished difference Result 282 states and 337 transitions. [2019-11-23 20:47:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-23 20:47:06,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2019-11-23 20:47:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:06,803 INFO L225 Difference]: With dead ends: 282 [2019-11-23 20:47:06,803 INFO L226 Difference]: Without dead ends: 280 [2019-11-23 20:47:06,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1161, Invalid=7211, Unknown=0, NotChecked=0, Total=8372 [2019-11-23 20:47:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-23 20:47:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 54. [2019-11-23 20:47:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 20:47:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-11-23 20:47:06,818 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 49 [2019-11-23 20:47:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:06,819 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-11-23 20:47:06,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:47:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-11-23 20:47:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:47:06,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:06,820 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:07,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:07,023 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:07,023 INFO L82 PathProgramCache]: Analyzing trace with hash -817714952, now seen corresponding path program 7 times [2019-11-23 20:47:07,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:07,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080405382] [2019-11-23 20:47:07,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:07,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080405382] [2019-11-23 20:47:07,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368755199] [2019-11-23 20:47:07,508 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 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:47:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:07,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:47:07,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:47:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-23 20:47:07,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764656754] [2019-11-23 20:47:07,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:47:07,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:47:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:47:07,859 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 25 states. [2019-11-23 20:47:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:08,227 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2019-11-23 20:47:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:47:08,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-11-23 20:47:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:08,228 INFO L225 Difference]: With dead ends: 105 [2019-11-23 20:47:08,228 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 20:47:08,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:47:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 20:47:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2019-11-23 20:47:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 20:47:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-23 20:47:08,242 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 53 [2019-11-23 20:47:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:08,242 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-23 20:47:08,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:47:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-23 20:47:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:47:08,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:08,243 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:08,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:08,444 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1220350103, now seen corresponding path program 8 times [2019-11-23 20:47:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37697583] [2019-11-23 20:47:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:08,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37697583] [2019-11-23 20:47:08,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147336398] [2019-11-23 20:47:08,690 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 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:47:08,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:47:08,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:08,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 20:47:08,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:08,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:08,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:08,906 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:47:08,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-23 20:47:08,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:08,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:08,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:08,954 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:47:08,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-11-23 20:47:08,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:08,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:47:08,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:08,971 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:47:08,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-23 20:47:09,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:09,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:09,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-23 20:47:09,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409080844] [2019-11-23 20:47:09,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:47:09,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:47:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:47:09,228 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 28 states. [2019-11-23 20:47:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:18,046 INFO L93 Difference]: Finished difference Result 1313 states and 1695 transitions. [2019-11-23 20:47:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2019-11-23 20:47:18,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2019-11-23 20:47:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:18,053 INFO L225 Difference]: With dead ends: 1313 [2019-11-23 20:47:18,053 INFO L226 Difference]: Without dead ends: 1311 [2019-11-23 20:47:18,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22401 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4180, Invalid=47576, Unknown=0, NotChecked=0, Total=51756 [2019-11-23 20:47:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-23 20:47:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 111. [2019-11-23 20:47:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 20:47:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2019-11-23 20:47:18,100 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 63 [2019-11-23 20:47:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:18,101 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2019-11-23 20:47:18,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:47:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2019-11-23 20:47:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:47:18,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:18,101 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:18,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:18,302 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -560818581, now seen corresponding path program 2 times [2019-11-23 20:47:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:18,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810257947] [2019-11-23 20:47:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:18,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810257947] [2019-11-23 20:47:18,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273978879] [2019-11-23 20:47:18,575 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 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:47:18,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:47:18,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:18,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:47:18,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:18,740 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 16 treesize of output 12 [2019-11-23 20:47:18,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:18,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:18,750 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:47:18,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:47:18,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:18,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:18,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:18,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:18,788 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:47:18,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:47:18,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:18,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:47:18,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:18,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:18,812 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:47:18,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:47:19,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:19,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:19,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-11-23 20:47:19,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109961335] [2019-11-23 20:47:19,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:47:19,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:19,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:47:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:47:19,064 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand 29 states. [2019-11-23 20:47:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:24,824 INFO L93 Difference]: Finished difference Result 368 states and 446 transitions. [2019-11-23 20:47:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-11-23 20:47:24,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2019-11-23 20:47:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:24,826 INFO L225 Difference]: With dead ends: 368 [2019-11-23 20:47:24,826 INFO L226 Difference]: Without dead ends: 366 [2019-11-23 20:47:24,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4116 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1505, Invalid=10927, Unknown=0, NotChecked=0, Total=12432 [2019-11-23 20:47:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-23 20:47:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 68. [2019-11-23 20:47:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 20:47:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-11-23 20:47:24,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 63 [2019-11-23 20:47:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:24,852 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-11-23 20:47:24,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:47:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-11-23 20:47:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:47:24,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:24,853 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:25,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:25,056 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2095709855, now seen corresponding path program 9 times [2019-11-23 20:47:25,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:25,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61700718] [2019-11-23 20:47:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:25,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61700718] [2019-11-23 20:47:25,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108776749] [2019-11-23 20:47:25,250 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 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:47:25,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-23 20:47:25,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:25,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:47:25,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:25,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:25,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:25,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:25,369 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:47:25,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:47:25,382 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:25,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:25,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:25,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:25,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:47:25,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-11-23 20:47:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:25,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:25,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2019-11-23 20:47:25,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298556230] [2019-11-23 20:47:25,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:47:25,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:47:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:47:25,577 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 23 states. [2019-11-23 20:47:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:38,148 INFO L93 Difference]: Finished difference Result 1886 states and 2424 transitions. [2019-11-23 20:47:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 318 states. [2019-11-23 20:47:38,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-11-23 20:47:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:38,157 INFO L225 Difference]: With dead ends: 1886 [2019-11-23 20:47:38,157 INFO L226 Difference]: Without dead ends: 1884 [2019-11-23 20:47:38,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46320 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5310, Invalid=97410, Unknown=0, NotChecked=0, Total=102720 [2019-11-23 20:47:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2019-11-23 20:47:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 128. [2019-11-23 20:47:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-23 20:47:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2019-11-23 20:47:38,234 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 67 [2019-11-23 20:47:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:38,234 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2019-11-23 20:47:38,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:47:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2019-11-23 20:47:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:47:38,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:38,235 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:38,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:38,440 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1066350557, now seen corresponding path program 2 times [2019-11-23 20:47:38,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:38,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492144021] [2019-11-23 20:47:38,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:38,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492144021] [2019-11-23 20:47:38,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121140916] [2019-11-23 20:47:38,715 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 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:47:38,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:47:38,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:38,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 20:47:38,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:38,911 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 16 treesize of output 12 [2019-11-23 20:47:38,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:38,919 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:47:38,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:47:38,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:38,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:47:38,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:38,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:47:38,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:47:39,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:39,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:39,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-11-23 20:47:39,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209529526] [2019-11-23 20:47:39,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:47:39,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:47:39,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:47:39,240 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand 31 states. [2019-11-23 20:47:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:46,450 INFO L93 Difference]: Finished difference Result 414 states and 494 transitions. [2019-11-23 20:47:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-11-23 20:47:46,450 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2019-11-23 20:47:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:46,453 INFO L225 Difference]: With dead ends: 414 [2019-11-23 20:47:46,453 INFO L226 Difference]: Without dead ends: 412 [2019-11-23 20:47:46,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6033 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1963, Invalid=15593, Unknown=0, NotChecked=0, Total=17556 [2019-11-23 20:47:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-23 20:47:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 72. [2019-11-23 20:47:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 20:47:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-11-23 20:47:46,485 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2019-11-23 20:47:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:46,486 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-11-23 20:47:46,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:47:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-11-23 20:47:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 20:47:46,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:46,487 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:46,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:46,691 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:46,692 INFO L82 PathProgramCache]: Analyzing trace with hash -311786795, now seen corresponding path program 10 times [2019-11-23 20:47:46,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:46,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712924421] [2019-11-23 20:47:46,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:46,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712924421] [2019-11-23 20:47:46,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705883814] [2019-11-23 20:47:46,894 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 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:47:46,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:47:46,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:46,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 20:47:46,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:47,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:47,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:47,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:47,064 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:47:47,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:47:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:47,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:47,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-11-23 20:47:47,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110489204] [2019-11-23 20:47:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:47:47,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:47:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:47:47,384 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 32 states.