java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:52:22,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:52:22,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:52:22,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:52:22,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:52:22,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:52:22,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:52:22,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:52:22,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:52:22,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:52:22,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:52:22,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:52:22,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:52:22,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:52:22,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:52:22,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:52:22,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:52:22,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:52:22,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:52:22,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:52:22,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:52:22,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:52:22,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:52:22,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:52:22,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:52:22,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:52:22,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:52:22,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:52:22,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:52:22,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:52:22,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:52:22,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:52:22,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:52:22,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:52:22,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:52:22,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:52:22,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:52:22,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:52:22,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:52:22,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:52:22,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:52:22,426 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-09-03 19:52:22,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:52:22,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:52:22,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:52:22,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:52:22,451 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:52:22,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:52:22,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:52:22,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:52:22,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:52:22,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:52:22,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:52:22,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:52:22,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:52:22,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:52:22,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:52:22,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:52:22,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:52:22,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:52:22,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:52:22,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:52:22,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:52:22,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:52:22,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:52:22,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:52:22,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:52:22,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:52:22,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:52:22,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:52:22,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:52:22,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:52:22,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:52:22,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:52:22,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:52:22,536 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:52:22,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-03 19:52:22,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d29ef5/cd419abe3a5849e795f7f80217bac83d/FLAGc87a23f72 [2019-09-03 19:52:23,039 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:52:23,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-03 19:52:23,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d29ef5/cd419abe3a5849e795f7f80217bac83d/FLAGc87a23f72 [2019-09-03 19:52:23,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d29ef5/cd419abe3a5849e795f7f80217bac83d [2019-09-03 19:52:23,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:52:23,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:52:23,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:52:23,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:52:23,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:52:23,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2301ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23, skipping insertion in model container [2019-09-03 19:52:23,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:52:23,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:52:23,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:52:23,663 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:52:23,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:52:23,800 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:52:23,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23 WrapperNode [2019-09-03 19:52:23,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:52:23,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:52:23,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:52:23,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:52:23,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (1/1) ... [2019-09-03 19:52:23,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:52:23,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:52:23,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:52:23,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:52:23,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (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-09-03 19:52:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:52:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:52:23,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:52:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:52:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:52:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:52:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:52:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:52:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:52:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:52:24,158 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:52:24,158 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:52:24,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:52:24 BoogieIcfgContainer [2019-09-03 19:52:24,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:52:24,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:52:24,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:52:24,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:52:24,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:52:23" (1/3) ... [2019-09-03 19:52:24,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d8bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:52:24, skipping insertion in model container [2019-09-03 19:52:24,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:23" (2/3) ... [2019-09-03 19:52:24,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d8bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:52:24, skipping insertion in model container [2019-09-03 19:52:24,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:52:24" (3/3) ... [2019-09-03 19:52:24,180 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-09-03 19:52:24,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:52:24,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:52:24,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:52:24,273 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:52:24,274 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:52:24,274 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:52:24,274 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:52:24,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:52:24,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:52:24,274 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:52:24,275 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:52:24,275 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:52:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-03 19:52:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:24,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:24,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:24,309 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-09-03 19:52:24,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:24,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:24,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:24,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:52:24,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:52:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:52:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:52:24,514 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-03 19:52:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:24,751 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2019-09-03 19:52:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:52:24,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-03 19:52:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:24,772 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:52:24,773 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:52:24,778 INFO L628 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-09-03 19:52:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:52:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:52:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:52:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-09-03 19:52:24,847 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-09-03 19:52:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:24,847 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-09-03 19:52:24,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:52:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-09-03 19:52:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:24,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:24,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:24,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-09-03 19:52:24,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:24,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:24,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:52:24,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:52:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:52:24,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:52:24,939 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2019-09-03 19:52:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,050 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-03 19:52:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:52:25,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-03 19:52:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,052 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:52:25,052 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:52:25,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:52:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:52:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:52:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:52:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-03 19:52:25,061 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-03 19:52:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,061 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-03 19:52:25,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:52:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-03 19:52:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:25,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,063 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2019-09-03 19:52:25,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:25,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:25,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:52:25,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:52:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:52:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:52:25,150 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2019-09-03 19:52:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,274 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-03 19:52:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:52:25,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-03 19:52:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,276 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:52:25,276 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:52:25,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:52:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:52:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:52:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:52:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-03 19:52:25,284 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-09-03 19:52:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,284 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-03 19:52:25,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:52:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-03 19:52:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:25,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,286 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2019-09-03 19:52:25,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:25,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:25,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-03 19:52:25,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:52:25,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:52:25,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:52:25,446 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2019-09-03 19:52:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,529 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-03 19:52:25,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:52:25,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 19:52:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,530 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:52:25,530 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:52:25,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:52:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:52:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:52:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:52:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 19:52:25,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2019-09-03 19:52:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,536 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 19:52:25,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:52:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 19:52:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:25,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,538 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2019-09-03 19:52:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:25,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:25,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:52:25,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:52:25,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:52:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:52:25,575 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2019-09-03 19:52:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,628 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-03 19:52:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:52:25,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-03 19:52:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,632 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:52:25,632 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:52:25,635 INFO L628 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-09-03 19:52:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:52:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:52:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:52:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 19:52:25,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-03 19:52:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,646 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 19:52:25,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:52:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 19:52:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:52:25,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,648 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2019-09-03 19:52:25,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:25,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-03 19:52:25,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:52:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:52:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:52:25,786 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-03 19:52:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,873 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-03 19:52:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:52:25,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-03 19:52:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,876 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:52:25,876 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:52:25,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:52:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:52:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:52:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:52:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 19:52:25,885 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-09-03 19:52:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,887 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 19:52:25,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:52:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 19:52:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:52:25,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,889 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,889 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2019-09-03 19:52:25,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:26,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:26,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-03 19:52:26,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:52:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:52:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:52:26,030 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-03 19:52:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:26,119 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-03 19:52:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:52:26,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-03 19:52:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:26,121 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:52:26,121 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:52:26,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:52:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:52:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:52:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:52:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-03 19:52:26,126 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-03 19:52:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:26,126 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-03 19:52:26,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:52:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-03 19:52:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:52:26,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:26,128 INFO L399 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, 1, 1, 1] [2019-09-03 19:52:26,128 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-09-03 19:52:26,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:26,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:26,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:26,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:52:26,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:26,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-03 19:52:26,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:52:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:52:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:52:26,411 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2019-09-03 19:52:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:26,496 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-03 19:52:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:52:26,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-03 19:52:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:26,499 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:52:26,499 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:52:26,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:52:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:52:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:52:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:52:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-03 19:52:26,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-09-03 19:52:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:26,512 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-03 19:52:26,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:52:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-03 19:52:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:52:26,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:26,514 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:26,518 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2019-09-03 19:52:26,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:26,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:26,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:26,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:26,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:26,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:26,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:26,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:26,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:52:26,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:52:26,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:26,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-03 19:52:26,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:52:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:52:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:52:26,720 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2019-09-03 19:52:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:26,806 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-03 19:52:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:52:26,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-09-03 19:52:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:26,808 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:52:26,808 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:52:26,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:52:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:52:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:52:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:52:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-03 19:52:26,822 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2019-09-03 19:52:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:26,822 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-03 19:52:26,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:52:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-03 19:52:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:52:26,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:26,824 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:26,824 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash -291122700, now seen corresponding path program 3 times [2019-09-03 19:52:26,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:26,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:26,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:26,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:27,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:27,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:52:27,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:27,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:52:27,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:52:27,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-09-03 19:52:27,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:52:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:52:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:52:27,088 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2019-09-03 19:52:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:27,187 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-03 19:52:27,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:52:27,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-09-03 19:52:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:27,189 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:52:27,189 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:52:27,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:52:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:52:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 19:52:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:52:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-03 19:52:27,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2019-09-03 19:52:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:27,195 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-03 19:52:27,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:52:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-03 19:52:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:52:27,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:27,196 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:27,196 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1159645813, now seen corresponding path program 4 times [2019-09-03 19:52:27,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:27,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:27,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:52:27,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:27,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:27,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:27,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:27,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:27,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:52:27,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:52:27,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:27,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-03 19:52:27,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:52:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:52:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:52:27,386 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2019-09-03 19:52:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:27,514 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-03 19:52:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:52:27,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-09-03 19:52:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:27,516 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:52:27,516 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:52:27,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:52:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:52:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:52:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:52:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-03 19:52:27,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-09-03 19:52:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:27,523 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-03 19:52:27,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:52:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-03 19:52:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:52:27,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:27,524 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:27,524 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1330868616, now seen corresponding path program 5 times [2019-09-03 19:52:27,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:27,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:52:27,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:27,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:27,752 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-03 19:52:27,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:27,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:52:27,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:52:27,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:27,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2019-09-03 19:52:27,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:52:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:52:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:52:27,840 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-09-03 19:52:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:27,971 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-09-03 19:52:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:52:27,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-09-03 19:52:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:27,972 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:52:27,972 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:52:27,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:52:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:52:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-03 19:52:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:52:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 19:52:27,984 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2019-09-03 19:52:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:27,984 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 19:52:27,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:52:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 19:52:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:52:27,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:27,985 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:27,986 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1267923961, now seen corresponding path program 6 times [2019-09-03 19:52:27,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:52:28,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:28,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:28,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:52:28,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:28,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:52:28,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:52:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-03 19:52:28,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:52:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:52:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:52:28,245 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2019-09-03 19:52:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:28,351 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-03 19:52:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:52:28,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-09-03 19:52:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:28,352 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:52:28,353 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:52:28,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:52:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:52:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-03 19:52:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:52:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-03 19:52:28,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2019-09-03 19:52:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:28,362 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-03 19:52:28,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:52:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-03 19:52:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:52:28,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:28,363 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:28,364 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1690572042, now seen corresponding path program 7 times [2019-09-03 19:52:28,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:28,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:28,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:52:28,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:28,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:28,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:52:28,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:28,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-03 19:52:28,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:52:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:52:28,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:52:28,622 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 19 states. [2019-09-03 19:52:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:28,744 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-03 19:52:28,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:52:28,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-09-03 19:52:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:28,746 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:52:28,746 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:52:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:52:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:52:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-03 19:52:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:52:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-09-03 19:52:28,752 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-09-03 19:52:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:28,752 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-09-03 19:52:28,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:52:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-09-03 19:52:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:52:28,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:28,753 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:28,753 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1536880973, now seen corresponding path program 8 times [2019-09-03 19:52:28,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:28,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:28,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:52:28,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:28,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:28,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:28,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:28,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:52:28,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 75 proven. 49 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 19:52:29,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2019-09-03 19:52:29,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:52:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:52:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:29,148 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 28 states. [2019-09-03 19:52:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:29,293 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-09-03 19:52:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:52:29,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-09-03 19:52:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:29,294 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:52:29,294 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:52:29,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:52:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-03 19:52:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 19:52:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-03 19:52:29,309 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2019-09-03 19:52:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:29,309 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-03 19:52:29,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:52:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-03 19:52:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 19:52:29,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:29,311 INFO L399 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:29,311 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2034313832, now seen corresponding path program 9 times [2019-09-03 19:52:29,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:29,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 150 proven. 90 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 19:52:29,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:29,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:29,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:29,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:52:29,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:29,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:29,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:30,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:30,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 47 [2019-09-03 19:52:30,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:52:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:52:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:52:30,432 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 47 states. [2019-09-03 19:52:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:30,683 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2019-09-03 19:52:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:52:30,683 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 61 [2019-09-03 19:52:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:30,685 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:52:30,685 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 19:52:30,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:52:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 19:52:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-03 19:52:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:52:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-03 19:52:30,714 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 61 [2019-09-03 19:52:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:30,715 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-03 19:52:30,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:52:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-03 19:52:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-03 19:52:30,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:30,716 INFO L399 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:30,716 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1443054295, now seen corresponding path program 10 times [2019-09-03 19:52:30,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:30,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:30,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 561 proven. 110 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-03 19:52:31,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:31,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:31,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:31,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:31,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:52:31,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 561 proven. 110 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:31,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-03 19:52:31,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:52:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:52:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:52:31,126 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 22 states. [2019-09-03 19:52:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,372 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-09-03 19:52:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:52:31,372 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 99 [2019-09-03 19:52:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,373 INFO L225 Difference]: With dead ends: 156 [2019-09-03 19:52:31,373 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 19:52:31,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:52:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 19:52:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-03 19:52:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 19:52:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-03 19:52:31,381 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-03 19:52:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,382 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-03 19:52:31,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:52:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-03 19:52:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 19:52:31,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,383 INFO L399 BasicCegarLoop]: trace histogram [37, 26, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,384 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash 430708646, now seen corresponding path program 11 times [2019-09-03 19:52:31,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 612 proven. 132 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-03 19:52:31,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:31,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:31,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-03 19:52:31,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:31,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:52:31,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 583 proven. 676 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 19:52:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:32,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 50 [2019-09-03 19:52:32,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:52:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:52:32,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:32,764 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 50 states. [2019-09-03 19:52:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:33,076 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2019-09-03 19:52:33,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:52:33,077 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 101 [2019-09-03 19:52:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:33,078 INFO L225 Difference]: With dead ends: 161 [2019-09-03 19:52:33,078 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:52:33,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:52:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-03 19:52:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 19:52:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-03 19:52:33,089 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2019-09-03 19:52:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:33,090 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-03 19:52:33,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:52:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-03 19:52:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 19:52:33,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:33,091 INFO L399 BasicCegarLoop]: trace histogram [39, 27, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:33,092 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1508217725, now seen corresponding path program 12 times [2019-09-03 19:52:33,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:33,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:33,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:33,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 689 proven. 156 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-03 19:52:33,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:33,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:33,431 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-03 19:52:33,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:33,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:52:33,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 660 proven. 729 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 19:52:34,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:34,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30] total 52 [2019-09-03 19:52:34,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:52:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:52:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:52:34,350 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 52 states. [2019-09-03 19:52:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:34,608 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2019-09-03 19:52:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:52:34,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 105 [2019-09-03 19:52:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:34,609 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:52:34,610 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:52:34,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:52:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:52:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-03 19:52:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:52:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-03 19:52:34,617 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 105 [2019-09-03 19:52:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:34,617 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-03 19:52:34,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:52:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-03 19:52:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 19:52:34,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:34,619 INFO L399 BasicCegarLoop]: trace histogram [41, 28, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:34,619 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 997928724, now seen corresponding path program 13 times [2019-09-03 19:52:34,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 770 proven. 182 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:34,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:34,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:34,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:52:34,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 770 proven. 182 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:34,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:34,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-03 19:52:35,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:52:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:52:35,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:52:35,001 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 25 states. [2019-09-03 19:52:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:35,146 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2019-09-03 19:52:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:52:35,147 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-09-03 19:52:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:35,148 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:52:35,148 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:52:35,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:52:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:52:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 19:52:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:52:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 19:52:35,152 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-03 19:52:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:35,153 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 19:52:35,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:52:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 19:52:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 19:52:35,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:35,154 INFO L399 BasicCegarLoop]: trace histogram [42, 28, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:35,154 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash 921522513, now seen corresponding path program 14 times [2019-09-03 19:52:35,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 825 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:35,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:35,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:35,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:35,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:35,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:52:35,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 825 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:35,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:35,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-03 19:52:35,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:52:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:52:35,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:52:35,549 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 26 states. [2019-09-03 19:52:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:35,688 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-09-03 19:52:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:52:35,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-09-03 19:52:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:35,690 INFO L225 Difference]: With dead ends: 172 [2019-09-03 19:52:35,690 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:52:35,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:52:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:52:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-03 19:52:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:52:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-03 19:52:35,695 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-09-03 19:52:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:35,696 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-03 19:52:35,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:52:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-03 19:52:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 19:52:35,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:35,697 INFO L399 BasicCegarLoop]: trace histogram [43, 28, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:35,697 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 509597774, now seen corresponding path program 15 times [2019-09-03 19:52:35,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 880 proven. 240 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:35,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:35,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:36,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 19:52:36,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:36,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:36,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 880 proven. 240 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:36,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:36,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-03 19:52:36,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:52:36,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:52:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:52:36,085 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 27 states. [2019-09-03 19:52:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:36,251 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-09-03 19:52:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:52:36,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2019-09-03 19:52:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:36,255 INFO L225 Difference]: With dead ends: 174 [2019-09-03 19:52:36,255 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:52:36,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:52:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:52:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-09-03 19:52:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 19:52:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-09-03 19:52:36,263 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 113 [2019-09-03 19:52:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:36,264 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-09-03 19:52:36,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:52:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-09-03 19:52:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 19:52:36,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:36,265 INFO L399 BasicCegarLoop]: trace histogram [44, 28, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:36,265 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -213085173, now seen corresponding path program 16 times [2019-09-03 19:52:36,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:36,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 935 proven. 272 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:36,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:36,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:36,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:36,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:36,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:36,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:52:36,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 935 proven. 272 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:36,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:36,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-03 19:52:36,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:52:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:52:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:36,818 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 28 states. [2019-09-03 19:52:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:36,938 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2019-09-03 19:52:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:52:36,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2019-09-03 19:52:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:36,940 INFO L225 Difference]: With dead ends: 176 [2019-09-03 19:52:36,940 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:52:36,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:52:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 19:52:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:52:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-03 19:52:36,946 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2019-09-03 19:52:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:36,947 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-03 19:52:36,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:52:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-03 19:52:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:52:36,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:36,948 INFO L399 BasicCegarLoop]: trace histogram [45, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:36,948 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1073304712, now seen corresponding path program 17 times [2019-09-03 19:52:36,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:36,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 990 proven. 306 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:52:37,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:37,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:37,341 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:37,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-03 19:52:37,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:37,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:52:37,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 969 proven. 784 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:38,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-03 19:52:38,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:52:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:52:38,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:52:38,317 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 58 states. [2019-09-03 19:52:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:38,613 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-09-03 19:52:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:52:38,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 117 [2019-09-03 19:52:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:38,615 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:52:38,615 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:52:38,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:52:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:52:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-03 19:52:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:52:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-03 19:52:38,622 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 117 [2019-09-03 19:52:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:38,622 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-03 19:52:38,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:52:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-03 19:52:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 19:52:38,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:38,623 INFO L399 BasicCegarLoop]: trace histogram [47, 29, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:38,624 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:38,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -709786145, now seen corresponding path program 18 times [2019-09-03 19:52:38,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:38,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1083 proven. 342 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-03 19:52:39,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:39,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:39,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:39,124 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-09-03 19:52:39,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:39,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:52:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1062 proven. 841 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 19:52:40,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:40,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 60 [2019-09-03 19:52:40,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:52:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:52:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:52:40,013 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 60 states. [2019-09-03 19:52:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:40,267 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-09-03 19:52:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:52:40,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 121 [2019-09-03 19:52:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:40,268 INFO L225 Difference]: With dead ends: 187 [2019-09-03 19:52:40,269 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 19:52:40,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:52:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 19:52:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-03 19:52:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 19:52:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-03 19:52:40,275 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 121 [2019-09-03 19:52:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:40,276 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-03 19:52:40,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:52:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-03 19:52:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 19:52:40,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:40,277 INFO L399 BasicCegarLoop]: trace histogram [49, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:40,277 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash -934578442, now seen corresponding path program 19 times [2019-09-03 19:52:40,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:40,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1180 proven. 380 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:40,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:40,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:40,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:52:40,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1180 proven. 380 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:40,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:40,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-03 19:52:40,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:52:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:52:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:40,943 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 31 states. [2019-09-03 19:52:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:41,103 INFO L93 Difference]: Finished difference Result 190 states and 192 transitions. [2019-09-03 19:52:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:52:41,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2019-09-03 19:52:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:41,104 INFO L225 Difference]: With dead ends: 190 [2019-09-03 19:52:41,105 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:52:41,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:52:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 19:52:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 19:52:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 19:52:41,111 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-09-03 19:52:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:41,111 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 19:52:41,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:52:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 19:52:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 19:52:41,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:41,113 INFO L399 BasicCegarLoop]: trace histogram [50, 30, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:41,113 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1739816755, now seen corresponding path program 20 times [2019-09-03 19:52:41,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:41,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1239 proven. 420 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:41,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:41,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:41,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:41,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:41,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:52:41,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1239 proven. 420 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:41,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:41,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-03 19:52:41,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:52:41,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:52:41,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:52:41,665 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 32 states. [2019-09-03 19:52:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:41,847 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-09-03 19:52:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:52:41,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-03 19:52:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:41,849 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:52:41,849 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 19:52:41,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:52:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 19:52:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-09-03 19:52:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-03 19:52:41,855 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 127 [2019-09-03 19:52:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:41,855 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-03 19:52:41,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:52:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-03 19:52:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 19:52:41,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:41,856 INFO L399 BasicCegarLoop]: trace histogram [51, 30, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:41,857 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -851809232, now seen corresponding path program 21 times [2019-09-03 19:52:41,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1298 proven. 462 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:42,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:42,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:42,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:42,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 19:52:42,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:42,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:52:42,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1298 proven. 462 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-03 19:52:42,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:52:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:52:42,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:42,377 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 33 states. [2019-09-03 19:52:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:42,553 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2019-09-03 19:52:42,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:52:42,554 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2019-09-03 19:52:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:42,555 INFO L225 Difference]: With dead ends: 194 [2019-09-03 19:52:42,555 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 19:52:42,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 19:52:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-09-03 19:52:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:52:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-09-03 19:52:42,562 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-09-03 19:52:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:42,562 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-09-03 19:52:42,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:52:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-09-03 19:52:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-03 19:52:42,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:42,564 INFO L399 BasicCegarLoop]: trace histogram [52, 30, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:42,564 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash -323351059, now seen corresponding path program 22 times [2019-09-03 19:52:42,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1357 proven. 506 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:43,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:43,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:43,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:43,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:43,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:52:43,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1357 proven. 506 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:43,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:43,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-03 19:52:43,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:52:43,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:52:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:52:43,140 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 34 states. [2019-09-03 19:52:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:43,292 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2019-09-03 19:52:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:52:43,293 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 131 [2019-09-03 19:52:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:43,294 INFO L225 Difference]: With dead ends: 196 [2019-09-03 19:52:43,294 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 19:52:43,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:52:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 19:52:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-03 19:52:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 19:52:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-03 19:52:43,300 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-09-03 19:52:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:43,300 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-03 19:52:43,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:52:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-03 19:52:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 19:52:43,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:43,302 INFO L399 BasicCegarLoop]: trace histogram [53, 30, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:43,302 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:43,303 INFO L82 PathProgramCache]: Analyzing trace with hash 718812266, now seen corresponding path program 23 times [2019-09-03 19:52:43,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:43,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1416 proven. 552 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 19:52:43,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:43,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:43,863 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:52:43,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:43,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:52:43,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1403 proven. 900 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 19:52:44,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:44,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 66 [2019-09-03 19:52:44,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:52:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:52:44,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:52:44,911 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 66 states. [2019-09-03 19:52:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:45,218 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2019-09-03 19:52:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:52:45,219 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 133 [2019-09-03 19:52:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:45,220 INFO L225 Difference]: With dead ends: 201 [2019-09-03 19:52:45,220 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 19:52:45,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:52:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 19:52:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-03 19:52:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 19:52:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-03 19:52:45,228 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 133 [2019-09-03 19:52:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:45,229 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-03 19:52:45,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:52:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-03 19:52:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 19:52:45,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:45,230 INFO L399 BasicCegarLoop]: trace histogram [55, 31, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:45,230 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -223978687, now seen corresponding path program 24 times [2019-09-03 19:52:45,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1525 proven. 600 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 19:52:45,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:45,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:45,761 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:45,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:52:45,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:45,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:52:45,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1512 proven. 961 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:46,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:46,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 68 [2019-09-03 19:52:46,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:52:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:52:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:52:46,926 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 68 states. [2019-09-03 19:52:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:47,320 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2019-09-03 19:52:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:52:47,320 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 137 [2019-09-03 19:52:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:47,321 INFO L225 Difference]: With dead ends: 207 [2019-09-03 19:52:47,321 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:52:47,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:52:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:52:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-03 19:52:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 19:52:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-03 19:52:47,328 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2019-09-03 19:52:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:47,329 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-03 19:52:47,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:52:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-03 19:52:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 19:52:47,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:47,330 INFO L399 BasicCegarLoop]: trace histogram [57, 32, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:47,330 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1341398568, now seen corresponding path program 25 times [2019-09-03 19:52:47,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:47,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:47,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1638 proven. 650 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:47,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:47,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:52:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1638 proven. 650 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:47,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:47,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-03 19:52:47,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:52:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:52:47,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:47,969 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 37 states. [2019-09-03 19:52:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:48,120 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2019-09-03 19:52:48,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:52:48,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 141 [2019-09-03 19:52:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:48,122 INFO L225 Difference]: With dead ends: 210 [2019-09-03 19:52:48,122 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:52:48,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:52:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 19:52:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 19:52:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 19:52:48,128 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-09-03 19:52:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:48,128 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 19:52:48,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:52:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 19:52:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:48,129 INFO L399 BasicCegarLoop]: trace histogram [58, 32, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:48,129 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 115200021, now seen corresponding path program 26 times [2019-09-03 19:52:48,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:48,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1701 proven. 702 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:48,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:48,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:48,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:48,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:48,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:48,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:52:48,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1701 proven. 702 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:48,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:48,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-03 19:52:48,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:52:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:52:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:48,755 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 38 states. [2019-09-03 19:52:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:48,929 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2019-09-03 19:52:48,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:52:48,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-09-03 19:52:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:48,931 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:52:48,931 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 19:52:48,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 19:52:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-09-03 19:52:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:52:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-03 19:52:48,938 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 143 [2019-09-03 19:52:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:48,940 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-03 19:52:48,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:52:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-03 19:52:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 19:52:48,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:48,941 INFO L399 BasicCegarLoop]: trace histogram [59, 32, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:48,941 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -252894446, now seen corresponding path program 27 times [2019-09-03 19:52:48,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:48,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:48,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1764 proven. 756 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:49,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:49,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 19:52:49,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:49,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:52:49,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1764 proven. 756 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:49,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-03 19:52:49,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:52:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:52:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:52:49,856 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 39 states. [2019-09-03 19:52:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:50,008 INFO L93 Difference]: Finished difference Result 214 states and 216 transitions. [2019-09-03 19:52:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:52:50,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2019-09-03 19:52:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:50,009 INFO L225 Difference]: With dead ends: 214 [2019-09-03 19:52:50,010 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 19:52:50,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:52:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 19:52:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-03 19:52:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 19:52:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-03 19:52:50,014 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 145 [2019-09-03 19:52:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:50,014 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-03 19:52:50,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:52:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-03 19:52:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 19:52:50,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:50,015 INFO L399 BasicCegarLoop]: trace histogram [60, 32, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:50,016 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1804358961, now seen corresponding path program 28 times [2019-09-03 19:52:50,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:50,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:50,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:50,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1827 proven. 812 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:50,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:50,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:50,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:50,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:50,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:50,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:52:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1827 proven. 812 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:50,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:50,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-03 19:52:50,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:52:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:52:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:52:50,745 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 40 states. [2019-09-03 19:52:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:50,938 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2019-09-03 19:52:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:52:50,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 147 [2019-09-03 19:52:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:50,940 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:52:50,940 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:52:50,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:52:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:52:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-03 19:52:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:52:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-03 19:52:50,947 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-09-03 19:52:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:50,948 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-03 19:52:50,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:52:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-03 19:52:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 19:52:50,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:50,949 INFO L399 BasicCegarLoop]: trace histogram [61, 32, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:50,949 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1886861132, now seen corresponding path program 29 times [2019-09-03 19:52:50,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:50,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1890 proven. 870 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 19:52:51,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:51,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:51,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-09-03 19:52:51,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:51,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:52:51,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1885 proven. 1024 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 19:52:53,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:53,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 35] total 74 [2019-09-03 19:52:53,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:52:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:52:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:52:53,108 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 74 states. [2019-09-03 19:52:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:53,452 INFO L93 Difference]: Finished difference Result 221 states and 224 transitions. [2019-09-03 19:52:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:52:53,453 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 149 [2019-09-03 19:52:53,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:53,454 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:52:53,455 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:52:53,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:52:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:52:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 19:52:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 19:52:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-03 19:52:53,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2019-09-03 19:52:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:53,461 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-03 19:52:53,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:52:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-03 19:52:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 19:52:53,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:53,462 INFO L399 BasicCegarLoop]: trace histogram [63, 33, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:53,463 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash 223515555, now seen corresponding path program 30 times [2019-09-03 19:52:53,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:53,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2015 proven. 930 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-03 19:52:54,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:54,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:54,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:54,451 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-03 19:52:54,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:54,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:52:54,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2010 proven. 1089 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-03 19:52:55,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:55,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 36] total 76 [2019-09-03 19:52:55,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:52:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:52:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:52:55,760 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 76 states. [2019-09-03 19:52:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:56,125 INFO L93 Difference]: Finished difference Result 227 states and 230 transitions. [2019-09-03 19:52:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:52:56,125 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 153 [2019-09-03 19:52:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:56,126 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:52:56,126 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 19:52:56,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:52:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 19:52:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-03 19:52:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 19:52:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-03 19:52:56,133 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 153 [2019-09-03 19:52:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:56,135 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-03 19:52:56,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:52:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-03 19:52:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:52:56,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:56,137 INFO L399 BasicCegarLoop]: trace histogram [65, 34, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:56,137 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash -39129158, now seen corresponding path program 31 times [2019-09-03 19:52:56,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2144 proven. 992 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:56,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:56,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:56,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:56,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:52:56,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2144 proven. 992 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-03 19:52:56,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:52:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:52:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:52:56,948 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 43 states. [2019-09-03 19:52:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:57,124 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2019-09-03 19:52:57,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:52:57,125 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2019-09-03 19:52:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:57,126 INFO L225 Difference]: With dead ends: 230 [2019-09-03 19:52:57,126 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:52:57,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:52:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:52:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-03 19:52:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:52:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 19:52:57,132 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-09-03 19:52:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:57,132 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 19:52:57,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:52:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 19:52:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 19:52:57,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:57,133 INFO L399 BasicCegarLoop]: trace histogram [66, 34, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:57,133 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1218788361, now seen corresponding path program 32 times [2019-09-03 19:52:57,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:57,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 1056 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:58,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:58,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:58,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:58,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:58,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:52:58,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 1056 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-03 19:52:58,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:52:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:52:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:52:58,440 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 44 states. [2019-09-03 19:52:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:58,666 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2019-09-03 19:52:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:52:58,667 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 159 [2019-09-03 19:52:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:58,669 INFO L225 Difference]: With dead ends: 232 [2019-09-03 19:52:58,669 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 19:52:58,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:52:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 19:52:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-03 19:52:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 19:52:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-03 19:52:58,677 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-09-03 19:52:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:58,678 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-03 19:52:58,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:52:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-03 19:52:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 19:52:58,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:58,680 INFO L399 BasicCegarLoop]: trace histogram [67, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:58,680 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -999916300, now seen corresponding path program 33 times [2019-09-03 19:52:58,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:58,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:59,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:59,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-03 19:52:59,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:52:59,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:52:59,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:59,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-03 19:52:59,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:52:59,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:52:59,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:52:59,878 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 45 states. [2019-09-03 19:53:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:00,055 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2019-09-03 19:53:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:53:00,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 161 [2019-09-03 19:53:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:00,056 INFO L225 Difference]: With dead ends: 234 [2019-09-03 19:53:00,056 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 19:53:00,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:53:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 19:53:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-09-03 19:53:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 19:53:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-09-03 19:53:00,062 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-09-03 19:53:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:00,062 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-09-03 19:53:00,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:53:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-09-03 19:53:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 19:53:00,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:00,064 INFO L399 BasicCegarLoop]: trace histogram [68, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:00,064 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1117263183, now seen corresponding path program 34 times [2019-09-03 19:53:00,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:00,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:00,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1190 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:53:01,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:01,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:01,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:01,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:01,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:53:01,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1190 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:53:01,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:01,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-03 19:53:01,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:53:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:53:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:01,374 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 46 states. [2019-09-03 19:53:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:01,586 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2019-09-03 19:53:01,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:53:01,587 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 163 [2019-09-03 19:53:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:01,588 INFO L225 Difference]: With dead ends: 236 [2019-09-03 19:53:01,588 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 19:53:01,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 19:53:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-09-03 19:53:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 19:53:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-03 19:53:01,595 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-09-03 19:53:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:01,595 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-03 19:53:01,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:53:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-03 19:53:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 19:53:01,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:01,597 INFO L399 BasicCegarLoop]: trace histogram [69, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:01,597 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2076499246, now seen corresponding path program 35 times [2019-09-03 19:53:01,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:01,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:01,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2412 proven. 1260 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:53:02,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:02,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:02,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:02,594 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-03 19:53:02,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:02,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:53:02,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 1156 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 19:53:04,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:04,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 37] total 82 [2019-09-03 19:53:04,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:53:04,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:53:04,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:53:04,113 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 82 states. [2019-09-03 19:53:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:04,486 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-09-03 19:53:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:53:04,487 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 165 [2019-09-03 19:53:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:04,488 INFO L225 Difference]: With dead ends: 241 [2019-09-03 19:53:04,488 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:53:04,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:53:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:53:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-03 19:53:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:53:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-03 19:53:04,496 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 165 [2019-09-03 19:53:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:04,497 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-03 19:53:04,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:53:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-03 19:53:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 19:53:04,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:04,498 INFO L399 BasicCegarLoop]: trace histogram [71, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:04,498 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:04,499 INFO L82 PathProgramCache]: Analyzing trace with hash 654618373, now seen corresponding path program 36 times [2019-09-03 19:53:04,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:04,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:04,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2553 proven. 1332 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-03 19:53:05,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:05,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:05,419 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:05,529 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 71 check-sat command(s) [2019-09-03 19:53:05,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:05,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:53:05,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 1225 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-03 19:53:07,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:07,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 38] total 84 [2019-09-03 19:53:07,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:53:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:53:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:53:07,071 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 84 states. [2019-09-03 19:53:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:07,487 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-09-03 19:53:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:53:07,487 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 169 [2019-09-03 19:53:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:07,488 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:53:07,489 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 19:53:07,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:53:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 19:53:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-03 19:53:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 19:53:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-03 19:53:07,495 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 169 [2019-09-03 19:53:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:07,495 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-03 19:53:07,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:53:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-03 19:53:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 19:53:07,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:07,497 INFO L399 BasicCegarLoop]: trace histogram [73, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:07,497 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash 819404956, now seen corresponding path program 37 times [2019-09-03 19:53:07,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:07,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2698 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 19:53:08,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:08,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:08,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:53:08,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2698 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:08,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:08,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-03 19:53:08,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:53:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:53:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:53:08,487 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 49 states. [2019-09-03 19:53:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:08,678 INFO L93 Difference]: Finished difference Result 250 states and 252 transitions. [2019-09-03 19:53:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:53:08,678 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 173 [2019-09-03 19:53:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:08,680 INFO L225 Difference]: With dead ends: 250 [2019-09-03 19:53:08,680 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:53:08,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:53:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:53:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-03 19:53:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 19:53:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 19:53:08,686 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-09-03 19:53:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:08,687 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 19:53:08,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:53:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 19:53:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 19:53:08,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:08,688 INFO L399 BasicCegarLoop]: trace histogram [74, 38, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:08,688 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1864836391, now seen corresponding path program 38 times [2019-09-03 19:53:08,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:08,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:08,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:08,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:08,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1482 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 19:53:09,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:09,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:09,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:09,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:09,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:09,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:53:09,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1482 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:53:09,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:09,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-03 19:53:09,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:53:09,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:53:09,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:53:09,777 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 50 states. [2019-09-03 19:53:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:09,978 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2019-09-03 19:53:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:53:09,978 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 175 [2019-09-03 19:53:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:09,980 INFO L225 Difference]: With dead ends: 252 [2019-09-03 19:53:09,980 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:53:09,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:53:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:53:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-09-03 19:53:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 19:53:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-03 19:53:09,985 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-09-03 19:53:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:09,986 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-03 19:53:09,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:53:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-03 19:53:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 19:53:09,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:09,987 INFO L399 BasicCegarLoop]: trace histogram [75, 39, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:09,987 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash -145425962, now seen corresponding path program 39 times [2019-09-03 19:53:09,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:09,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:09,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2840 proven. 1560 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 19:53:11,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:11,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:11,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:11,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-03 19:53:11,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:53:11,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2847 proven. 1296 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-03 19:53:13,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:13,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 39] total 88 [2019-09-03 19:53:13,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:53:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:53:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:53:13,207 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 88 states. [2019-09-03 19:53:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:13,683 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2019-09-03 19:53:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:53:13,685 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 177 [2019-09-03 19:53:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:13,686 INFO L225 Difference]: With dead ends: 257 [2019-09-03 19:53:13,686 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 19:53:13,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:53:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 19:53:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-03 19:53:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 19:53:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-03 19:53:13,694 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 177 [2019-09-03 19:53:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:13,695 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-03 19:53:13,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:53:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-03 19:53:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 19:53:13,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:13,696 INFO L399 BasicCegarLoop]: trace histogram [77, 40, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:13,696 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:13,697 INFO L82 PathProgramCache]: Analyzing trace with hash -223007187, now seen corresponding path program 40 times [2019-09-03 19:53:13,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:13,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:13,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:13,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1640 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-03 19:53:15,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:15,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:15,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:15,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:53:15,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1640 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-03 19:53:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:15,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-03 19:53:15,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:53:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:53:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:53:15,132 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 52 states. [2019-09-03 19:53:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:15,382 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2019-09-03 19:53:15,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:53:15,383 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 181 [2019-09-03 19:53:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:15,384 INFO L225 Difference]: With dead ends: 260 [2019-09-03 19:53:15,384 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 19:53:15,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:53:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 19:53:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-03 19:53:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 19:53:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 19:53:15,390 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-09-03 19:53:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:15,390 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 19:53:15,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:53:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 19:53:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 19:53:15,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:15,392 INFO L399 BasicCegarLoop]: trace histogram [78, 41, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:15,392 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 41 times [2019-09-03 19:53:15,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:15,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:18,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:18,234 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2019-09-03 19:53:18,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:18,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:53:18,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3080 proven. 1444 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-03 19:53:18,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:18,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 41] total 91 [2019-09-03 19:53:18,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:53:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:53:18,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:53:18,334 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 91 states. [2019-09-03 19:53:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:18,794 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-09-03 19:53:18,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:53:18,795 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 183 [2019-09-03 19:53:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:18,797 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:53:18,797 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 19:53:18,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:53:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 19:53:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-03 19:53:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 19:53:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-09-03 19:53:18,804 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 183 [2019-09-03 19:53:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:18,804 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-09-03 19:53:18,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:53:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-09-03 19:53:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 19:53:18,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:18,806 INFO L399 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:18,806 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 42 times [2019-09-03 19:53:18,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:18,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:18,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:21,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:21,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:21,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:21,811 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2019-09-03 19:53:21,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:21,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:53:21,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42] total 92 [2019-09-03 19:53:21,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:53:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:53:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:53:21,848 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-09-03 19:53:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:22,356 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2019-09-03 19:53:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:53:22,356 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-03 19:53:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:22,357 INFO L225 Difference]: With dead ends: 194 [2019-09-03 19:53:22,358 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 19:53:22,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:53:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 19:53:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-03 19:53:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 19:53:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-03 19:53:22,364 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-09-03 19:53:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:22,364 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-03 19:53:22,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:53:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-03 19:53:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 19:53:22,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:22,366 INFO L399 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:22,366 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 43 times [2019-09-03 19:53:22,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:22,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:25,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:25,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:25,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:53:25,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:25,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:25,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-03 19:53:25,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:53:25,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:53:25,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:53:25,421 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-09-03 19:53:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:25,866 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2019-09-03 19:53:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:53:25,866 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-03 19:53:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:25,868 INFO L225 Difference]: With dead ends: 196 [2019-09-03 19:53:25,868 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 19:53:25,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:53:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 19:53:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-03 19:53:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 19:53:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 19:53:25,875 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-09-03 19:53:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:25,876 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 19:53:25,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:53:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 19:53:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 19:53:25,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:25,877 INFO L399 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:25,877 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 44 times [2019-09-03 19:53:25,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:29,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:29,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:29,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:29,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:53:29,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:29,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:29,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-03 19:53:29,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:53:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:53:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:53:29,983 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-09-03 19:53:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:30,514 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-09-03 19:53:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 19:53:30,515 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-03 19:53:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:30,517 INFO L225 Difference]: With dead ends: 198 [2019-09-03 19:53:30,517 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:53:30,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:53:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:53:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-03 19:53:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 19:53:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-03 19:53:30,522 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-09-03 19:53:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:30,522 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-03 19:53:30,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:53:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-03 19:53:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 19:53:30,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:30,524 INFO L399 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:30,524 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 45 times [2019-09-03 19:53:30,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:30,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:30,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:33,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:33,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:33,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:33,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-03 19:53:33,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:33,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:53:33,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-03 19:53:34,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:53:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:53:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:53:34,029 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-09-03 19:53:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:34,543 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2019-09-03 19:53:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:53:34,543 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-03 19:53:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:34,544 INFO L225 Difference]: With dead ends: 200 [2019-09-03 19:53:34,544 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 19:53:34,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:53:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 19:53:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-03 19:53:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 19:53:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-09-03 19:53:34,550 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-09-03 19:53:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:34,551 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-09-03 19:53:34,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:53:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-09-03 19:53:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-03 19:53:34,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:34,552 INFO L399 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:34,552 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 46 times [2019-09-03 19:53:34,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:34,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:37,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:37,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:37,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:37,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:53:37,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-03 19:53:37,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 19:53:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 19:53:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:53:37,843 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-09-03 19:53:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,382 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2019-09-03 19:53:38,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:53:38,383 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-03 19:53:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,384 INFO L225 Difference]: With dead ends: 202 [2019-09-03 19:53:38,384 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 19:53:38,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:53:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 19:53:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-03 19:53:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 19:53:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-03 19:53:38,389 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-09-03 19:53:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,390 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-03 19:53:38,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 19:53:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-03 19:53:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 19:53:38,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,391 INFO L399 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,391 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 47 times [2019-09-03 19:53:38,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:41,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:41,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:41,566 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:41,680 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 86 check-sat command(s) [2019-09-03 19:53:41,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:41,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:53:41,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1936 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 47] total 97 [2019-09-03 19:53:41,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:53:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:53:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:53:41,724 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-09-03 19:53:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,282 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2019-09-03 19:53:42,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:53:42,283 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-03 19:53:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,284 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:53:42,284 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 19:53:42,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:53:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 19:53:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-03 19:53:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 19:53:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 19:53:42,290 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-09-03 19:53:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,290 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 19:53:42,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:53:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 19:53:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 19:53:42,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,292 INFO L399 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,292 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 48 times [2019-09-03 19:53:42,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:45,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:45,691 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-09-03 19:53:45,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:45,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-03 19:53:45,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 19:53:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 19:53:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:53:45,735 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-09-03 19:53:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:46,284 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2019-09-03 19:53:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:53:46,285 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-03 19:53:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:46,286 INFO L225 Difference]: With dead ends: 206 [2019-09-03 19:53:46,286 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:53:46,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:53:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:53:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-03 19:53:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 19:53:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-03 19:53:46,293 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-09-03 19:53:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:46,294 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-03 19:53:46,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 19:53:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-03 19:53:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-03 19:53:46,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:46,296 INFO L399 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:46,296 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 49 times [2019-09-03 19:53:46,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:46,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:49,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:49,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:53:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:49,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-03 19:53:49,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:53:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:53:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:53:49,924 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-09-03 19:53:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:50,508 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-09-03 19:53:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:53:50,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-03 19:53:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:50,510 INFO L225 Difference]: With dead ends: 208 [2019-09-03 19:53:50,510 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 19:53:50,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:53:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 19:53:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-03 19:53:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-03 19:53:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-09-03 19:53:50,516 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-09-03 19:53:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:50,516 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-09-03 19:53:50,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:53:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-09-03 19:53:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-03 19:53:50,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:50,518 INFO L399 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:50,518 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 50 times [2019-09-03 19:53:50,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:53,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:53,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:53,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:53,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:53:53,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:54,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:54,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-03 19:53:54,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 19:53:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 19:53:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:53:54,003 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-09-03 19:53:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,514 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-09-03 19:53:54,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 19:53:54,515 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-03 19:53:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,517 INFO L225 Difference]: With dead ends: 210 [2019-09-03 19:53:54,517 INFO L226 Difference]: Without dead ends: 207 [2019-09-03 19:53:54,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:53:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-03 19:53:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-03 19:53:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 19:53:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-03 19:53:54,523 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-09-03 19:53:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,523 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-03 19:53:54,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 19:53:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-03 19:53:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 19:53:54,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,525 INFO L399 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,525 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 51 times [2019-09-03 19:53:54,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:57,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:58,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-03 19:53:58,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:58,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:53:58,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:58,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:58,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-03 19:53:58,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:53:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:53:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:53:58,193 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-09-03 19:53:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:58,807 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-09-03 19:53:58,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:53:58,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-03 19:53:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:58,808 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:53:58,808 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 19:53:58,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:53:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 19:53:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-03 19:53:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 19:53:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 19:53:58,814 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-09-03 19:53:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:58,815 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 19:53:58,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:53:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 19:53:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 19:53:58,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:58,816 INFO L399 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:58,816 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 52 times [2019-09-03 19:53:58,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:02,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:02,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:02,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:02,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:02,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 19:54:02,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:02,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:02,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-03 19:54:02,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:54:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:54:02,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:54:02,425 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-09-03 19:54:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:02,979 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-09-03 19:54:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 19:54:02,979 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-03 19:54:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:02,981 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:54:02,981 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:54:02,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:54:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:54:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-03 19:54:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 19:54:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-03 19:54:02,987 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-09-03 19:54:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:02,987 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-03 19:54:02,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:54:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-03 19:54:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-03 19:54:02,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:02,988 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:02,989 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 53 times [2019-09-03 19:54:02,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 19:54:05,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:05,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:05,367 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 92 check-sat command(s) [2019-09-03 19:54:05,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:05,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:54:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:05,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 19:54:05,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:05,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-03 19:54:05,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:54:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:54:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:54:05,553 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-09-03 19:54:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:07,238 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2019-09-03 19:54:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:54:07,238 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-03 19:54:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:07,240 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:54:07,240 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:54:07,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:54:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:54:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-03 19:54:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-03 19:54:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-09-03 19:54:07,249 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-09-03 19:54:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:07,249 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-09-03 19:54:07,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:54:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-09-03 19:54:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 19:54:07,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:07,251 INFO L399 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:07,251 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 54 times [2019-09-03 19:54:07,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:07,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:07,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:07,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 19:54:08,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:54:08,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 19:54:08,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:54:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:54:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:08,683 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-09-03 19:54:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:08,903 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-09-03 19:54:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:54:08,904 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-03 19:54:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:08,904 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:54:08,904 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:54:08,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:54:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:54:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:54:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:54:08,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-03 19:54:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:08,906 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:54:08,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:54:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:54:08,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:54:08,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:54:09,056 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 307 [2019-09-03 19:54:10,536 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-09-03 19:54:10,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:54:10,547 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:54:10,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:54:10,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:54:10,547 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:54:10,548 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2019-09-03 19:54:10,548 INFO L439 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2019-09-03 19:54:10,548 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L439 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2019-09-03 19:54:10,550 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L439 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2019-09-03 19:54:10,550 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2019-09-03 19:54:10,550 INFO L439 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L439 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L439 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-09-03 19:54:10,551 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L439 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2019-09-03 19:54:10,551 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2019-09-03 19:54:10,551 INFO L439 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-09-03 19:54:10,551 INFO L439 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2019-09-03 19:54:10,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:54:10 BoogieIcfgContainer [2019-09-03 19:54:10,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:54:10,581 INFO L168 Benchmark]: Toolchain (without parser) took 107130.01 ms. Allocated memory was 138.4 MB in the beginning and 829.4 MB in the end (delta: 691.0 MB). Free memory was 85.8 MB in the beginning and 672.0 MB in the end (delta: -586.2 MB). Peak memory consumption was 699.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,581 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.73 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 85.6 MB in the beginning and 177.2 MB in the end (delta: -91.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,582 INFO L168 Benchmark]: Boogie Preprocessor took 35.54 ms. Allocated memory is still 198.7 MB. Free memory was 177.2 MB in the beginning and 174.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,583 INFO L168 Benchmark]: RCFGBuilder took 322.02 ms. Allocated memory is still 198.7 MB. Free memory was 174.9 MB in the beginning and 158.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,584 INFO L168 Benchmark]: TraceAbstraction took 106417.58 ms. Allocated memory was 198.7 MB in the beginning and 829.4 MB in the end (delta: 630.7 MB). Free memory was 157.9 MB in the beginning and 672.0 MB in the end (delta: -514.1 MB). Peak memory consumption was 711.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:10,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.73 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 85.6 MB in the beginning and 177.2 MB in the end (delta: -91.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.54 ms. Allocated memory is still 198.7 MB. Free memory was 177.2 MB in the beginning and 174.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.02 ms. Allocated memory is still 198.7 MB. Free memory was 174.9 MB in the beginning and 158.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106417.58 ms. Allocated memory was 198.7 MB in the beginning and 829.4 MB in the end (delta: 630.7 MB). Free memory was 157.9 MB in the beginning and 672.0 MB in the end (delta: -514.1 MB). Peak memory consumption was 711.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 106.2s OverallTime, 61 OverallIterations, 92 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 2667 SDslu, 14936 SDs, 0 SdLazy, 16833 SolverSat, 2491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9839 GetRequests, 6951 SyntacticMatches, 1 SemanticMatches, 2887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 61 MinimizatonAttempts, 27 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 79.0s InterpolantComputationTime, 14956 NumberOfCodeBlocks, 14894 NumberOfCodeBlocksAsserted, 1566 NumberOfCheckSat, 14842 ConstructedInterpolants, 0 QuantifiedInterpolants, 5778028 SizeOfPredicates, 30 NumberOfNonLiveVariables, 18374 ConjunctsInSsa, 2325 ConjunctsInUnsatCore, 114 InterpolantComputations, 8 PerfectInterpolantSequences, 185406/403759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...