/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/relax-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:18:37,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:18:37,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:18:37,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:18:37,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:18:37,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:18:37,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:18:37,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:18:37,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:18:37,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:18:37,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:18:37,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:18:37,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:18:37,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:18:37,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:18:37,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:18:37,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:18:37,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:18:37,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:18:37,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:18:37,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:18:37,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:18:37,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:18:37,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:18:37,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:18:37,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:18:37,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:18:37,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:18:37,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:18:37,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:18:37,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:18:37,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:18:37,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:18:37,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:18:37,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:18:37,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:18:37,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:18:37,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:18:37,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:18:37,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:18:37,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:18:37,667 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:18:37,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:18:37,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:18:37,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:18:37,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:18:37,694 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:18:37,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:18:37,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:18:37,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:18:37,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:18:37,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:18:37,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:18:37,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:18:37,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:18:37,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:18:37,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:18:37,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:18:37,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:18:37,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:18:37,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:18:37,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:18:37,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:18:37,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:18:37,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:18:37,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:18:37,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:18:37,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:18:37,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:18:37,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:18:37,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:18:37,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:18:38,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:18:38,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:18:38,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:18:38,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:18:38,045 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:18:38,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2.i [2019-11-23 20:18:38,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7fd276d/d0b8cc5c95114d888b85b412e7430494/FLAGca8fa9d6b [2019-11-23 20:18:38,660 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:18:38,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2.i [2019-11-23 20:18:38,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7fd276d/d0b8cc5c95114d888b85b412e7430494/FLAGca8fa9d6b [2019-11-23 20:18:38,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7fd276d/d0b8cc5c95114d888b85b412e7430494 [2019-11-23 20:18:38,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:18:38,992 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:18:38,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:18:38,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:18:38,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:18:38,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:18:38" (1/1) ... [2019-11-23 20:18:39,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4837be06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39, skipping insertion in model container [2019-11-23 20:18:39,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:18:38" (1/1) ... [2019-11-23 20:18:39,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:18:39,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:18:39,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:18:39,518 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:18:39,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:18:39,631 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:18:39,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39 WrapperNode [2019-11-23 20:18:39,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:18:39,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:18:39,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:18:39,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:18:39,642 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:18:39" (1/1) ... [2019-11-23 20:18:39,666 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:18:39" (1/1) ... [2019-11-23 20:18:39,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:18:39,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:18:39,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:18:39,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:18:39,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (1/1) ... [2019-11-23 20:18:39,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:18:39,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:18:39,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:18:39,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:18:39,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (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:18:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:18:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:18:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:18:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:18:39,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:18:40,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:18:40,301 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-23 20:18:40,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:18:40 BoogieIcfgContainer [2019-11-23 20:18:40,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:18:40,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:18:40,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:18:40,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:18:40,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:18:38" (1/3) ... [2019-11-23 20:18:40,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e36fc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:18:40, skipping insertion in model container [2019-11-23 20:18:40,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:18:39" (2/3) ... [2019-11-23 20:18:40,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e36fc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:18:40, skipping insertion in model container [2019-11-23 20:18:40,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:18:40" (3/3) ... [2019-11-23 20:18:40,312 INFO L109 eAbstractionObserver]: Analyzing ICFG relax-2.i [2019-11-23 20:18:40,322 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:18:40,330 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-23 20:18:40,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-23 20:18:40,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:18:40,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:18:40,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:18:40,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:18:40,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:18:40,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:18:40,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:18:40,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:18:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-23 20:18:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:18:40,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:40,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:40,393 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash -781886477, now seen corresponding path program 1 times [2019-11-23 20:18:40,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:40,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348399879] [2019-11-23 20:18:40,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:40,620 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:18:40,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348399879] [2019-11-23 20:18:40,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:40,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:18:40,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208044328] [2019-11-23 20:18:40,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:18:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:18:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:18:40,647 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2019-11-23 20:18:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:40,725 INFO L93 Difference]: Finished difference Result 99 states and 151 transitions. [2019-11-23 20:18:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:18:40,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:18:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:40,740 INFO L225 Difference]: With dead ends: 99 [2019-11-23 20:18:40,740 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:18:40,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:18:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-23 20:18:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 20:18:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-11-23 20:18:40,778 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 11 [2019-11-23 20:18:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:40,778 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-11-23 20:18:40,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:18:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-11-23 20:18:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 20:18:40,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:40,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:40,780 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1280852140, now seen corresponding path program 1 times [2019-11-23 20:18:40,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:40,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284789604] [2019-11-23 20:18:40,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:40,896 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:18:40,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284789604] [2019-11-23 20:18:40,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:40,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:40,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200328096] [2019-11-23 20:18:40,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:40,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:40,903 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 5 states. [2019-11-23 20:18:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:41,045 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2019-11-23 20:18:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:18:41,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 20:18:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:41,047 INFO L225 Difference]: With dead ends: 90 [2019-11-23 20:18:41,047 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 20:18:41,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:18:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 20:18:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-11-23 20:18:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 20:18:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2019-11-23 20:18:41,059 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 13 [2019-11-23 20:18:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:41,060 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2019-11-23 20:18:41,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2019-11-23 20:18:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:18:41,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:41,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:41,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1075701366, now seen corresponding path program 1 times [2019-11-23 20:18:41,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:41,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203960411] [2019-11-23 20:18:41,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:41,236 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:18:41,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203960411] [2019-11-23 20:18:41,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:41,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:41,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343659084] [2019-11-23 20:18:41,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:41,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:41,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:41,239 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 5 states. [2019-11-23 20:18:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:41,386 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2019-11-23 20:18:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:18:41,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 20:18:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:41,388 INFO L225 Difference]: With dead ends: 74 [2019-11-23 20:18:41,388 INFO L226 Difference]: Without dead ends: 60 [2019-11-23 20:18:41,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:18:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-23 20:18:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-11-23 20:18:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:18:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2019-11-23 20:18:41,406 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 15 [2019-11-23 20:18:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:41,406 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2019-11-23 20:18:41,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2019-11-23 20:18:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:18:41,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:41,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:41,411 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:41,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1378443542, now seen corresponding path program 1 times [2019-11-23 20:18:41,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:41,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589982306] [2019-11-23 20:18:41,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:41,691 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:18:41,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589982306] [2019-11-23 20:18:41,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401256704] [2019-11-23 20:18:41,692 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:18:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:41,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:18:41,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:41,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:18:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:41,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:18:41,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-11-23 20:18:41,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242759821] [2019-11-23 20:18:41,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:41,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:18:41,843 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand 5 states. [2019-11-23 20:18:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:41,980 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2019-11-23 20:18:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:18:41,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 20:18:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:41,982 INFO L225 Difference]: With dead ends: 63 [2019-11-23 20:18:41,982 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 20:18:41,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:18:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 20:18:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-23 20:18:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 20:18:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-11-23 20:18:41,991 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 15 [2019-11-23 20:18:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:41,992 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-11-23 20:18:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2019-11-23 20:18:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:18:41,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:41,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:42,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:42,199 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1993488721, now seen corresponding path program 1 times [2019-11-23 20:18:42,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:42,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898021538] [2019-11-23 20:18:42,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:42,278 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:18:42,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898021538] [2019-11-23 20:18:42,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:42,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:18:42,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965210721] [2019-11-23 20:18:42,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:18:42,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:18:42,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:18:42,281 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 4 states. [2019-11-23 20:18:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:42,318 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2019-11-23 20:18:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:18:42,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 20:18:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:42,320 INFO L225 Difference]: With dead ends: 62 [2019-11-23 20:18:42,320 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 20:18:42,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 20:18:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-23 20:18:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:18:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2019-11-23 20:18:42,332 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 17 [2019-11-23 20:18:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:42,332 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-11-23 20:18:42,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:18:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2019-11-23 20:18:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:18:42,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:42,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:42,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:42,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:42,337 INFO L82 PathProgramCache]: Analyzing trace with hash 998032502, now seen corresponding path program 1 times [2019-11-23 20:18:42,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:42,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761902576] [2019-11-23 20:18:42,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:18:42,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761902576] [2019-11-23 20:18:42,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:42,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:18:42,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785006221] [2019-11-23 20:18:42,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:18:42,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:42,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:18:42,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:18:42,632 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand 6 states. [2019-11-23 20:18:42,900 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-23 20:18:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:42,988 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2019-11-23 20:18:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:18:42,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-23 20:18:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:42,989 INFO L225 Difference]: With dead ends: 52 [2019-11-23 20:18:42,990 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 20:18:42,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:18:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 20:18:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-23 20:18:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:18:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-11-23 20:18:42,996 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 17 [2019-11-23 20:18:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:42,996 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-11-23 20:18:42,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:18:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-11-23 20:18:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:18:42,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:42,997 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:18:42,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 53284653, now seen corresponding path program 1 times [2019-11-23 20:18:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:42,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608410641] [2019-11-23 20:18:42,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:43,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608410641] [2019-11-23 20:18:43,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:43,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:18:43,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468007070] [2019-11-23 20:18:43,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:18:43,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:18:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:18:43,025 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 3 states. [2019-11-23 20:18:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:43,045 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2019-11-23 20:18:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:18:43,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 20:18:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:43,048 INFO L225 Difference]: With dead ends: 72 [2019-11-23 20:18:43,049 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 20:18:43,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:18:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 20:18:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2019-11-23 20:18:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 20:18:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-11-23 20:18:43,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 19 [2019-11-23 20:18:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-23 20:18:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:18:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-11-23 20:18:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:18:43,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:43,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:43,065 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -906067047, now seen corresponding path program 1 times [2019-11-23 20:18:43,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:43,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278781314] [2019-11-23 20:18:43,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:43,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278781314] [2019-11-23 20:18:43,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:43,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:43,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683871047] [2019-11-23 20:18:43,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:43,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:43,183 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 5 states. [2019-11-23 20:18:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:43,281 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2019-11-23 20:18:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:18:43,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-23 20:18:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:43,282 INFO L225 Difference]: With dead ends: 93 [2019-11-23 20:18:43,283 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 20:18:43,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:18:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 20:18:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-11-23 20:18:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 20:18:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2019-11-23 20:18:43,301 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 23 [2019-11-23 20:18:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:43,306 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2019-11-23 20:18:43,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2019-11-23 20:18:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:18:43,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:43,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:43,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1049603465, now seen corresponding path program 1 times [2019-11-23 20:18:43,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:43,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458861201] [2019-11-23 20:18:43,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:18:43,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458861201] [2019-11-23 20:18:43,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259252034] [2019-11-23 20:18:43,530 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:18:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:43,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:18:43,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:43,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:18:43,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-11-23 20:18:43,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826151357] [2019-11-23 20:18:43,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:18:43,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:18:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:18:43,671 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand 6 states. [2019-11-23 20:18:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:43,766 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2019-11-23 20:18:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:18:43,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-23 20:18:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:43,768 INFO L225 Difference]: With dead ends: 69 [2019-11-23 20:18:43,768 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 20:18:43,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:18:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 20:18:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-11-23 20:18:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-23 20:18:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-11-23 20:18:43,776 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 23 [2019-11-23 20:18:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:43,778 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-11-23 20:18:43,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:18:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2019-11-23 20:18:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:18:43,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:43,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:43,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:43,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -55505897, now seen corresponding path program 1 times [2019-11-23 20:18:43,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:43,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162386517] [2019-11-23 20:18:43,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:18:44,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162386517] [2019-11-23 20:18:44,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:44,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:44,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108753592] [2019-11-23 20:18:44,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:44,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:44,110 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 5 states. [2019-11-23 20:18:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:44,209 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2019-11-23 20:18:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:18:44,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-23 20:18:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:44,210 INFO L225 Difference]: With dead ends: 80 [2019-11-23 20:18:44,211 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 20:18:44,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:18:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 20:18:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-11-23 20:18:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:18:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-11-23 20:18:44,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 25 [2019-11-23 20:18:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:44,217 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-11-23 20:18:44,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-11-23 20:18:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:18:44,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:44,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:44,218 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -199042315, now seen corresponding path program 1 times [2019-11-23 20:18:44,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:44,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568892637] [2019-11-23 20:18:44,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568892637] [2019-11-23 20:18:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284950529] [2019-11-23 20:18:44,289 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:18:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:44,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:18:44,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:44,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:44,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-11-23 20:18:44,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294486274] [2019-11-23 20:18:44,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 20:18:44,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 20:18:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:18:44,481 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 9 states. [2019-11-23 20:18:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:44,677 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2019-11-23 20:18:44,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 20:18:44,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-23 20:18:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:44,680 INFO L225 Difference]: With dead ends: 140 [2019-11-23 20:18:44,681 INFO L226 Difference]: Without dead ends: 123 [2019-11-23 20:18:44,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:18:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-23 20:18:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 80. [2019-11-23 20:18:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 20:18:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2019-11-23 20:18:44,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 25 [2019-11-23 20:18:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:44,706 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2019-11-23 20:18:44,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 20:18:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2019-11-23 20:18:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:18:44,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:44,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:44,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:44,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -198982733, now seen corresponding path program 1 times [2019-11-23 20:18:44,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:44,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408429023] [2019-11-23 20:18:44,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:45,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408429023] [2019-11-23 20:18:45,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820379529] [2019-11-23 20:18:45,079 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:18:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:18:45,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:18:45,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:18:45,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-11-23 20:18:45,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737327625] [2019-11-23 20:18:45,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:18:45,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:18:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:18:45,160 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand 4 states. [2019-11-23 20:18:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:45,248 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2019-11-23 20:18:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:18:45,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-23 20:18:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:45,249 INFO L225 Difference]: With dead ends: 115 [2019-11-23 20:18:45,250 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 20:18:45,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:18:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 20:18:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-11-23 20:18:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-23 20:18:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2019-11-23 20:18:45,262 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 25 [2019-11-23 20:18:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:45,262 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2019-11-23 20:18:45,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:18:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2019-11-23 20:18:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 20:18:45,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:45,266 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:45,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:45,471 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash -216310142, now seen corresponding path program 1 times [2019-11-23 20:18:45,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:45,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744718316] [2019-11-23 20:18:45,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:18:45,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744718316] [2019-11-23 20:18:45,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:45,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:45,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404112040] [2019-11-23 20:18:45,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:45,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:45,541 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand 5 states. [2019-11-23 20:18:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:45,624 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2019-11-23 20:18:45,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:18:45,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-23 20:18:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:45,626 INFO L225 Difference]: With dead ends: 123 [2019-11-23 20:18:45,626 INFO L226 Difference]: Without dead ends: 118 [2019-11-23 20:18:45,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:18:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-23 20:18:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2019-11-23 20:18:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-23 20:18:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2019-11-23 20:18:45,635 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 26 [2019-11-23 20:18:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:45,636 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2019-11-23 20:18:45,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2019-11-23 20:18:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:18:45,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:45,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:45,637 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -390083533, now seen corresponding path program 2 times [2019-11-23 20:18:45,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:45,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586054831] [2019-11-23 20:18:45,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:18:45,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586054831] [2019-11-23 20:18:45,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:18:45,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:18:45,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765831880] [2019-11-23 20:18:45,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:18:45,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:18:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:18:45,702 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand 5 states. [2019-11-23 20:18:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:45,770 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2019-11-23 20:18:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:18:45,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-23 20:18:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:45,772 INFO L225 Difference]: With dead ends: 100 [2019-11-23 20:18:45,772 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 20:18:45,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:18:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 20:18:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-11-23 20:18:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 20:18:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2019-11-23 20:18:45,780 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 27 [2019-11-23 20:18:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:45,780 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2019-11-23 20:18:45,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:18:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2019-11-23 20:18:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:18:45,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:45,781 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, 1, 1, 1, 1, 1] [2019-11-23 20:18:45,781 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:45,782 INFO L82 PathProgramCache]: Analyzing trace with hash -90628969, now seen corresponding path program 1 times [2019-11-23 20:18:45,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:45,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616381501] [2019-11-23 20:18:45,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616381501] [2019-11-23 20:18:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348495467] [2019-11-23 20:18:45,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:18:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:45,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:18:45,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:45,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:45,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-23 20:18:45,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302608854] [2019-11-23 20:18:45,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:18:45,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:18:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:18:45,997 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand 13 states. [2019-11-23 20:18:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:46,809 INFO L93 Difference]: Finished difference Result 215 states and 268 transitions. [2019-11-23 20:18:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:18:46,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-23 20:18:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:46,811 INFO L225 Difference]: With dead ends: 215 [2019-11-23 20:18:46,811 INFO L226 Difference]: Without dead ends: 152 [2019-11-23 20:18:46,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:18:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-23 20:18:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2019-11-23 20:18:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 20:18:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-11-23 20:18:46,820 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 28 [2019-11-23 20:18:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:46,820 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-23 20:18:46,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:18:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-11-23 20:18:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:18:46,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:46,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:47,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:47,025 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1249359627, now seen corresponding path program 1 times [2019-11-23 20:18:47,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:47,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060766572] [2019-11-23 20:18:47,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:18:47,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060766572] [2019-11-23 20:18:47,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044557683] [2019-11-23 20:18:47,352 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:18:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:47,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:18:47,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:47,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-23 20:18:47,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782907227] [2019-11-23 20:18:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:18:47,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:18:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:18:47,553 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 16 states. [2019-11-23 20:18:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:48,538 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-11-23 20:18:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 20:18:48,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-23 20:18:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:48,542 INFO L225 Difference]: With dead ends: 157 [2019-11-23 20:18:48,542 INFO L226 Difference]: Without dead ends: 85 [2019-11-23 20:18:48,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:18:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-23 20:18:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2019-11-23 20:18:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 20:18:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-23 20:18:48,549 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2019-11-23 20:18:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:48,549 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-23 20:18:48,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:18:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-23 20:18:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:18:48,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:48,550 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:48,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:48,756 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1576807806, now seen corresponding path program 1 times [2019-11-23 20:18:48,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:48,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312531962] [2019-11-23 20:18:48,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:18:49,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312531962] [2019-11-23 20:18:49,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401993734] [2019-11-23 20:18:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:49,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 20:18:49,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:49,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 20:18:49,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:49,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:49,285 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:18:49,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-11-23 20:18:49,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:18:49,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:18:49,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:18:49,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:49,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 41 [2019-11-23 20:18:49,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:49,493 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-23 20:18:49,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:49,511 INFO L567 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2019-11-23 20:18:49,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:18:49,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:8 [2019-11-23 20:18:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:49,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:49,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-11-23 20:18:49,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064857893] [2019-11-23 20:18:49,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:18:49,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:18:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:18:49,529 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 21 states. [2019-11-23 20:18:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:50,384 INFO L93 Difference]: Finished difference Result 166 states and 209 transitions. [2019-11-23 20:18:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:18:50,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-23 20:18:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:50,386 INFO L225 Difference]: With dead ends: 166 [2019-11-23 20:18:50,386 INFO L226 Difference]: Without dead ends: 154 [2019-11-23 20:18:50,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:18:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-23 20:18:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 89. [2019-11-23 20:18:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 20:18:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2019-11-23 20:18:50,398 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 30 [2019-11-23 20:18:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:50,399 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2019-11-23 20:18:50,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:18:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2019-11-23 20:18:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:18:50,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:50,400 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:50,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:50,608 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:50,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -198199556, now seen corresponding path program 1 times [2019-11-23 20:18:50,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:50,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979982997] [2019-11-23 20:18:50,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:18:50,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979982997] [2019-11-23 20:18:50,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562325716] [2019-11-23 20:18:50,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:50,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:18:50,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:50,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:50,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-11-23 20:18:50,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447771673] [2019-11-23 20:18:50,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:18:50,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:18:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:18:50,928 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 15 states. [2019-11-23 20:18:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:51,500 INFO L93 Difference]: Finished difference Result 264 states and 345 transitions. [2019-11-23 20:18:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 20:18:51,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-11-23 20:18:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:51,502 INFO L225 Difference]: With dead ends: 264 [2019-11-23 20:18:51,502 INFO L226 Difference]: Without dead ends: 248 [2019-11-23 20:18:51,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:18:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-23 20:18:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 111. [2019-11-23 20:18:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 20:18:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2019-11-23 20:18:51,517 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 30 [2019-11-23 20:18:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:51,517 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2019-11-23 20:18:51,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:18:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2019-11-23 20:18:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:18:51,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:51,518 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:51,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:51,729 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash -941860773, now seen corresponding path program 2 times [2019-11-23 20:18:51,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:51,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571922058] [2019-11-23 20:18:51,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:18:51,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571922058] [2019-11-23 20:18:51,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910782284] [2019-11-23 20:18:51,883 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 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:18:51,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-23 20:18:51,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:18:51,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:18:51,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:52,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:18:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:18:52,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:18:52,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-11-23 20:18:52,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266169487] [2019-11-23 20:18:52,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:18:52,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:18:52,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:18:52,054 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand 6 states. [2019-11-23 20:18:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:52,171 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2019-11-23 20:18:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:18:52,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 20:18:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:52,173 INFO L225 Difference]: With dead ends: 132 [2019-11-23 20:18:52,173 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 20:18:52,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:18:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 20:18:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-23 20:18:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 20:18:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2019-11-23 20:18:52,186 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 32 [2019-11-23 20:18:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:52,187 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-11-23 20:18:52,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:18:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2019-11-23 20:18:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:18:52,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:52,188 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:52,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:52,399 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1144029883, now seen corresponding path program 1 times [2019-11-23 20:18:52,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:52,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515051751] [2019-11-23 20:18:52,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:18:52,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515051751] [2019-11-23 20:18:52,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160989188] [2019-11-23 20:18:52,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:18:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:52,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:18:52,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 20:18:52,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:52,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-23 20:18:52,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708959924] [2019-11-23 20:18:52,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:18:52,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:18:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:18:52,931 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand 16 states. [2019-11-23 20:18:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:54,216 INFO L93 Difference]: Finished difference Result 315 states and 407 transitions. [2019-11-23 20:18:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 20:18:54,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-23 20:18:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:54,219 INFO L225 Difference]: With dead ends: 315 [2019-11-23 20:18:54,219 INFO L226 Difference]: Without dead ends: 308 [2019-11-23 20:18:54,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:18:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-23 20:18:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 119. [2019-11-23 20:18:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-23 20:18:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2019-11-23 20:18:54,251 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 33 [2019-11-23 20:18:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:54,252 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2019-11-23 20:18:54,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:18:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2019-11-23 20:18:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:18:54,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:54,252 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:54,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:54,453 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -267913570, now seen corresponding path program 1 times [2019-11-23 20:18:54,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:54,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888452227] [2019-11-23 20:18:54,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:18:54,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888452227] [2019-11-23 20:18:54,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741481760] [2019-11-23 20:18:54,617 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:18:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:54,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:18:54,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:18:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:18:54,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:54,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-11-23 20:18:54,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196965862] [2019-11-23 20:18:54,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:18:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:18:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:18:54,832 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 15 states. [2019-11-23 20:18:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:55,423 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2019-11-23 20:18:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:18:55,423 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-23 20:18:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:55,424 INFO L225 Difference]: With dead ends: 206 [2019-11-23 20:18:55,425 INFO L226 Difference]: Without dead ends: 183 [2019-11-23 20:18:55,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:18:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-23 20:18:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2019-11-23 20:18:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-23 20:18:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2019-11-23 20:18:55,443 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 35 [2019-11-23 20:18:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:55,444 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2019-11-23 20:18:55,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:18:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2019-11-23 20:18:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:18:55,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:55,445 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:55,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:55,656 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1614273436, now seen corresponding path program 2 times [2019-11-23 20:18:55,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:55,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748733716] [2019-11-23 20:18:55,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:18:55,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748733716] [2019-11-23 20:18:55,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070993743] [2019-11-23 20:18:55,765 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 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:18:55,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:18:55,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:18:55,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:18:55,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:18:55,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:55,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-23 20:18:55,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177153281] [2019-11-23 20:18:55,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:18:55,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:55,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:18:55,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:18:55,939 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 14 states. [2019-11-23 20:18:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:56,262 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2019-11-23 20:18:56,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:18:56,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-23 20:18:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:56,263 INFO L225 Difference]: With dead ends: 173 [2019-11-23 20:18:56,263 INFO L226 Difference]: Without dead ends: 141 [2019-11-23 20:18:56,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:18:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-23 20:18:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2019-11-23 20:18:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-23 20:18:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2019-11-23 20:18:56,278 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 36 [2019-11-23 20:18:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:56,279 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2019-11-23 20:18:56,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:18:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2019-11-23 20:18:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:18:56,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:56,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:56,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:56,486 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1665105256, now seen corresponding path program 1 times [2019-11-23 20:18:56,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:56,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273354069] [2019-11-23 20:18:56,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:57,092 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-11-23 20:18:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:18:57,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273354069] [2019-11-23 20:18:57,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021816348] [2019-11-23 20:18:57,125 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:18:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:57,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-23 20:18:57,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:57,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 20:18:57,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:57,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:57,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:18:57,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-11-23 20:18:57,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:57,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2019-11-23 20:18:57,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:57,455 INFO L567 ElimStorePlain]: treesize reduction 3, result has 84.2 percent of original size [2019-11-23 20:18:57,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:18:57,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:4 [2019-11-23 20:18:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:18:57,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:57,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-23 20:18:57,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574458290] [2019-11-23 20:18:57,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:18:57,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:18:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:18:57,461 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand 26 states. [2019-11-23 20:18:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:58,186 INFO L93 Difference]: Finished difference Result 249 states and 322 transitions. [2019-11-23 20:18:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:18:58,187 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-11-23 20:18:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:58,188 INFO L225 Difference]: With dead ends: 249 [2019-11-23 20:18:58,188 INFO L226 Difference]: Without dead ends: 177 [2019-11-23 20:18:58,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:18:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-23 20:18:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2019-11-23 20:18:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-23 20:18:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-11-23 20:18:58,208 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 36 [2019-11-23 20:18:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:58,209 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-11-23 20:18:58,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:18:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-11-23 20:18:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 20:18:58,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:58,209 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:58,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:58,413 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -314454482, now seen corresponding path program 1 times [2019-11-23 20:18:58,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:58,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500307172] [2019-11-23 20:18:58,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:18:58,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500307172] [2019-11-23 20:18:58,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230986926] [2019-11-23 20:18:58,563 INFO L94 rtionOrderModulation]: Keeping assertion order 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:18:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:58,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-23 20:18:58,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:58,662 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:18:58,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:58,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:58,664 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:18:58,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:1 [2019-11-23 20:18:58,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:18:58,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:18:58,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:18:58,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:58,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 47 [2019-11-23 20:18:58,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:58,869 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-23 20:18:58,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:58,894 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-11-23 20:18:58,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:18:58,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:8 [2019-11-23 20:18:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:18:58,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:58,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2019-11-23 20:18:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189617211] [2019-11-23 20:18:58,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:18:58,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:18:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:18:58,926 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 19 states. [2019-11-23 20:19:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:19:00,697 INFO L93 Difference]: Finished difference Result 478 states and 625 transitions. [2019-11-23 20:19:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 20:19:00,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-11-23 20:19:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:19:00,699 INFO L225 Difference]: With dead ends: 478 [2019-11-23 20:19:00,699 INFO L226 Difference]: Without dead ends: 388 [2019-11-23 20:19:00,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 20:19:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-23 20:19:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 241. [2019-11-23 20:19:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 20:19:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 314 transitions. [2019-11-23 20:19:00,731 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 314 transitions. Word has length 38 [2019-11-23 20:19:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:19:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 314 transitions. [2019-11-23 20:19:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:19:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 314 transitions. [2019-11-23 20:19:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:19:00,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:19:00,732 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:19:00,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:19:00,936 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:19:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:19:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1390190390, now seen corresponding path program 1 times [2019-11-23 20:19:00,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:19:00,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16764357] [2019-11-23 20:19:00,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:19:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:19:01,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16764357] [2019-11-23 20:19:01,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078712389] [2019-11-23 20:19:01,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:19:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:01,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:19:01,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:19:01,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 20:19:01,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:19:01,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:19:01,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:19:01,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-11-23 20:19:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:19:01,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:19:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-23 20:19:01,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071522821] [2019-11-23 20:19:01,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:19:01,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:19:01,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:19:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:19:01,496 INFO L87 Difference]: Start difference. First operand 241 states and 314 transitions. Second operand 16 states. [2019-11-23 20:19:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:19:01,774 INFO L93 Difference]: Finished difference Result 351 states and 457 transitions. [2019-11-23 20:19:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:19:01,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-11-23 20:19:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:19:01,777 INFO L225 Difference]: With dead ends: 351 [2019-11-23 20:19:01,777 INFO L226 Difference]: Without dead ends: 340 [2019-11-23 20:19:01,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:19:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-23 20:19:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 250. [2019-11-23 20:19:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-23 20:19:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 323 transitions. [2019-11-23 20:19:01,815 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 323 transitions. Word has length 39 [2019-11-23 20:19:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:19:01,815 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 323 transitions. [2019-11-23 20:19:01,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:19:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 323 transitions. [2019-11-23 20:19:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:19:01,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:19:01,818 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:19:02,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:19:02,027 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:19:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:19:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1293767193, now seen corresponding path program 1 times [2019-11-23 20:19:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:19:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661571749] [2019-11-23 20:19:02,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:19:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:19:02,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661571749] [2019-11-23 20:19:02,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398223882] [2019-11-23 20:19:02,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:19:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:02,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:19:02,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:19:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:19:02,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:19:02,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-23 20:19:02,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326793040] [2019-11-23 20:19:02,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:19:02,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:19:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:19:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:19:02,713 INFO L87 Difference]: Start difference. First operand 250 states and 323 transitions. Second operand 20 states. [2019-11-23 20:19:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:19:03,737 INFO L93 Difference]: Finished difference Result 606 states and 784 transitions. [2019-11-23 20:19:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:19:03,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-11-23 20:19:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:19:03,740 INFO L225 Difference]: With dead ends: 606 [2019-11-23 20:19:03,740 INFO L226 Difference]: Without dead ends: 420 [2019-11-23 20:19:03,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:19:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-23 20:19:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 286. [2019-11-23 20:19:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-23 20:19:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 368 transitions. [2019-11-23 20:19:03,776 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 368 transitions. Word has length 39 [2019-11-23 20:19:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:19:03,776 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 368 transitions. [2019-11-23 20:19:03,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:19:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 368 transitions. [2019-11-23 20:19:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 20:19:03,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:19:03,777 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:19:03,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:19:03,981 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:19:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:19:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash -173403267, now seen corresponding path program 1 times [2019-11-23 20:19:03,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:19:03,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058432476] [2019-11-23 20:19:03,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:19:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:19:04,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058432476] [2019-11-23 20:19:04,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788131979] [2019-11-23 20:19:04,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:19:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:04,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-23 20:19:04,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:19:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 20:19:04,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:19:04,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:19:04,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:19:04,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-11-23 20:19:04,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:19:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:19:04,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:19:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-23 20:19:04,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405353531] [2019-11-23 20:19:04,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:19:04,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:19:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:19:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:19:04,681 INFO L87 Difference]: Start difference. First operand 286 states and 368 transitions. Second operand 26 states. [2019-11-23 20:19:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:19:05,844 INFO L93 Difference]: Finished difference Result 519 states and 680 transitions. [2019-11-23 20:19:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:19:05,845 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2019-11-23 20:19:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:19:05,847 INFO L225 Difference]: With dead ends: 519 [2019-11-23 20:19:05,847 INFO L226 Difference]: Without dead ends: 420 [2019-11-23 20:19:05,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:19:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-23 20:19:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 293. [2019-11-23 20:19:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-23 20:19:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 376 transitions. [2019-11-23 20:19:05,884 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 376 transitions. Word has length 40 [2019-11-23 20:19:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:19:05,884 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 376 transitions. [2019-11-23 20:19:05,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:19:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 376 transitions. [2019-11-23 20:19:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:19:05,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:19:05,885 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:19:06,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:19:06,086 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:19:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:19:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1928033487, now seen corresponding path program 2 times [2019-11-23 20:19:06,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:19:06,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356443966] [2019-11-23 20:19:06,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:19:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:19:06,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356443966] [2019-11-23 20:19:06,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367679603] [2019-11-23 20:19:06,213 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:19:06,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:19:06,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:19:06,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:19:06,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:19:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:19:06,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:19:06,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-23 20:19:06,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54714817] [2019-11-23 20:19:06,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:19:06,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:19:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:19:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:19:06,372 INFO L87 Difference]: Start difference. First operand 293 states and 376 transitions. Second operand 17 states. [2019-11-23 20:19:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:19:07,828 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2019-11-23 20:19:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 20:19:07,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-23 20:19:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:19:07,830 INFO L225 Difference]: With dead ends: 499 [2019-11-23 20:19:07,831 INFO L226 Difference]: Without dead ends: 377 [2019-11-23 20:19:07,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1851, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 20:19:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-23 20:19:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 285. [2019-11-23 20:19:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-23 20:19:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 360 transitions. [2019-11-23 20:19:07,862 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 360 transitions. Word has length 41 [2019-11-23 20:19:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:19:07,862 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 360 transitions. [2019-11-23 20:19:07,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:19:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 360 transitions. [2019-11-23 20:19:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:19:07,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:19:07,863 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:19:08,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:19:08,066 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:19:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:19:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash 248867429, now seen corresponding path program 2 times [2019-11-23 20:19:08,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:19:08,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946629276] [2019-11-23 20:19:08,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:19:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:19:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:19:08,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946629276] [2019-11-23 20:19:08,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141251828] [2019-11-23 20:19:08,951 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 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:19:09,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:19:09,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:19:09,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:19:09,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:19:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 20:19:09,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:19:09,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 28 [2019-11-23 20:19:09,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825601438] [2019-11-23 20:19:09,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:19:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:19:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:19:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:19:09,221 INFO L87 Difference]: Start difference. First operand 285 states and 360 transitions. Second operand 28 states. [2019-11-23 20:19:10,847 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-11-23 20:19:11,337 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-11-23 20:19:13,975 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-23 20:19:15,051 WARN L192 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-11-23 20:19:15,648 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-11-23 20:19:16,007 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-23 20:19:19,565 WARN L192 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-23 20:19:20,356 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-11-23 20:19:21,903 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-11-23 20:19:29,633 WARN L192 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-23 20:19:30,374 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-23 20:19:34,470 WARN L192 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-23 20:19:41,574 WARN L192 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-23 20:19:46,967 WARN L192 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-11-23 20:19:49,741 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-11-23 20:19:50,187 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-11-23 20:19:52,944 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-23 20:19:56,411 WARN L192 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-23 20:19:58,947 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-23 20:20:00,376 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-11-23 20:20:00,933 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-11-23 20:20:14,397 WARN L192 SmtUtils]: Spent 9.94 s on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-23 20:20:18,085 WARN L192 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 102 DAG size of output: 85