java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:29:34,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:29:34,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:29:34,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:29:34,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:29:34,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:29:34,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:29:34,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:29:34,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:29:34,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:29:34,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:29:34,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:29:34,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:29:34,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:29:34,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:29:34,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:29:34,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:29:34,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:29:34,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:29:34,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:29:34,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:29:34,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:29:34,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:29:34,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:29:34,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:29:34,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:29:34,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:29:34,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:29:34,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:29:34,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:29:34,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:29:34,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:29:34,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:29:34,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:29:34,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:29:34,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:29:34,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:29:34,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:29:34,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:29:34,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:29:34,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:29:34,595 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-10-01 22:29:34,616 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:29:34,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:29:34,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:29:34,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:29:34,618 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:29:34,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:29:34,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:29:34,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:29:34,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:29:34,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:29:34,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:29:34,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:29:34,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:29:34,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:29:34,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:29:34,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:29:34,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:29:34,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:29:34,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:29:34,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:29:34,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:29:34,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:29:34,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:29:34,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:29:34,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:29:34,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:29:34,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:29:34,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:29:34,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:29:34,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:29:34,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:29:34,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:29:34,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:29:34,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:29:34,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-01 22:29:34,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5b5690a/4ea91df6d0a743ffbd38061aad568dcf/FLAGdf2da3bfd [2019-10-01 22:29:35,196 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:29:35,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-01 22:29:35,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5b5690a/4ea91df6d0a743ffbd38061aad568dcf/FLAGdf2da3bfd [2019-10-01 22:29:35,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5b5690a/4ea91df6d0a743ffbd38061aad568dcf [2019-10-01 22:29:35,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:29:35,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:29:35,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:29:35,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:29:35,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:29:35,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5370fc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35, skipping insertion in model container [2019-10-01 22:29:35,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,635 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:29:35,652 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:29:35,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:29:35,825 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:29:35,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:29:35,950 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:29:35,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35 WrapperNode [2019-10-01 22:29:35,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:29:35,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:29:35,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:29:35,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:29:35,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (1/1) ... [2019-10-01 22:29:35,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:29:35,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:29:35,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:29:35,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:29:36,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (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-10-01 22:29:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:29:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:29:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:29:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:29:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:29:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:29:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:29:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:29:36,347 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:29:36,347 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-01 22:29:36,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:29:36 BoogieIcfgContainer [2019-10-01 22:29:36,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:29:36,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:29:36,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:29:36,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:29:36,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:29:35" (1/3) ... [2019-10-01 22:29:36,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc9083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:29:36, skipping insertion in model container [2019-10-01 22:29:36,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:35" (2/3) ... [2019-10-01 22:29:36,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc9083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:29:36, skipping insertion in model container [2019-10-01 22:29:36,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:29:36" (3/3) ... [2019-10-01 22:29:36,357 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_allDiff2_ground.i [2019-10-01 22:29:36,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:29:36,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:29:36,407 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:29:36,434 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:29:36,435 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:29:36,435 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:29:36,435 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:29:36,435 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:29:36,435 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:29:36,435 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:29:36,436 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:29:36,436 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:29:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-01 22:29:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:29:36,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:36,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:36,459 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -526773211, now seen corresponding path program 1 times [2019-10-01 22:29:36,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:29:36,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:29:36,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:29:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:29:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:29:36,620 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-01 22:29:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:36,646 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-10-01 22:29:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:29:36,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:29:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:36,657 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:29:36,657 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 22:29:36,662 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:29:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 22:29:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-01 22:29:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:29:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 22:29:36,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2019-10-01 22:29:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:36,709 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 22:29:36,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:29:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 22:29:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:29:36,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:36,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:36,711 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash -777624222, now seen corresponding path program 1 times [2019-10-01 22:29:36,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:36,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:36,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:36,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:29:36,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:36,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:29:36,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:29:36,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:29:36,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:29:36,808 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-01 22:29:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:36,893 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-10-01 22:29:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:29:36,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:29:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:36,896 INFO L225 Difference]: With dead ends: 48 [2019-10-01 22:29:36,896 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:29:36,897 INFO L640 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-10-01 22:29:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:29:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:29:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:29:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-01 22:29:36,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2019-10-01 22:29:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:36,911 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-01 22:29:36,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:29:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-01 22:29:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:29:36,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:36,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:36,915 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2101592964, now seen corresponding path program 1 times [2019-10-01 22:29:36,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:36,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:37,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:37,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 22:29:37,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:29:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:29:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:29:37,009 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-10-01 22:29:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,076 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-10-01 22:29:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:29:37,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-01 22:29:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,078 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:29:37,078 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:29:37,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:29:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:29:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-10-01 22:29:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:29:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-01 22:29:37,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-10-01 22:29:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,086 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-01 22:29:37,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:29:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-01 22:29:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:29:37,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,088 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1818591568, now seen corresponding path program 1 times [2019-10-01 22:29:37,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:37,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:37,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-01 22:29:37,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:29:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:29:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:29:37,166 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-10-01 22:29:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,302 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2019-10-01 22:29:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:29:37,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-01 22:29:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,304 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:29:37,304 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:29:37,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:29:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:29:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-10-01 22:29:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:29:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-01 22:29:37,313 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2019-10-01 22:29:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,313 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-01 22:29:37,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:29:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-01 22:29:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-01 22:29:37,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,315 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,315 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 334453631, now seen corresponding path program 1 times [2019-10-01 22:29:37,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:29:37,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:37,425 INFO L224 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) [2019-10-01 22:29:37,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:37,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:29:37,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:29:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-01 22:29:37,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:29:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:29:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:29:37,577 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 10 states. [2019-10-01 22:29:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,887 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2019-10-01 22:29:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:29:37,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-01 22:29:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,890 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:29:37,890 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 22:29:37,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:29:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 22:29:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-10-01 22:29:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:29:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-10-01 22:29:37,900 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 26 [2019-10-01 22:29:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,901 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-10-01 22:29:37,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:29:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-10-01 22:29:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:29:37,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,902 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,903 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1076752728, now seen corresponding path program 2 times [2019-10-01 22:29:37,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:29:38,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,055 INFO L224 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-10-01 22:29:38,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:38,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:38,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:38,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:29:38,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:29:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:38,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2019-10-01 22:29:38,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:29:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:29:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:29:38,156 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 12 states. [2019-10-01 22:29:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:38,547 INFO L93 Difference]: Finished difference Result 145 states and 198 transitions. [2019-10-01 22:29:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:29:38,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-10-01 22:29:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:38,551 INFO L225 Difference]: With dead ends: 145 [2019-10-01 22:29:38,551 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 22:29:38,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:29:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 22:29:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 63. [2019-10-01 22:29:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:29:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2019-10-01 22:29:38,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 34 [2019-10-01 22:29:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:38,587 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2019-10-01 22:29:38,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:29:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2019-10-01 22:29:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 22:29:38,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:38,596 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:38,596 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1104086922, now seen corresponding path program 1 times [2019-10-01 22:29:38,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:38,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:38,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:29:38,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,757 INFO L224 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:29:38,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:29:38,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-01 22:29:38,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:29:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:29:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:29:38,913 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 12 states. [2019-10-01 22:29:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:39,213 INFO L93 Difference]: Finished difference Result 178 states and 250 transitions. [2019-10-01 22:29:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:29:39,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-10-01 22:29:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:39,215 INFO L225 Difference]: With dead ends: 178 [2019-10-01 22:29:39,215 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 22:29:39,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:29:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 22:29:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 51. [2019-10-01 22:29:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:29:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-10-01 22:29:39,225 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 36 [2019-10-01 22:29:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:39,226 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-10-01 22:29:39,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:29:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-10-01 22:29:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:29:39,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:39,227 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:39,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1653847887, now seen corresponding path program 3 times [2019-10-01 22:29:39,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 22:29:39,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:39,382 INFO L224 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) [2019-10-01 22:29:39,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:39,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:29:39,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:29:39,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:39,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2019-10-01 22:29:39,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:29:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:29:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:29:39,511 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 13 states. [2019-10-01 22:29:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:39,996 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2019-10-01 22:29:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:29:39,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-10-01 22:29:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:39,998 INFO L225 Difference]: With dead ends: 160 [2019-10-01 22:29:39,998 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:29:40,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:29:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:29:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 85. [2019-10-01 22:29:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 22:29:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-10-01 22:29:40,025 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 41 [2019-10-01 22:29:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:40,026 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-10-01 22:29:40,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:29:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-10-01 22:29:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:29:40,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:40,031 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:40,031 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash -510083147, now seen corresponding path program 1 times [2019-10-01 22:29:40,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:40,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:40,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 22:29:40,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,133 INFO L224 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) [2019-10-01 22:29:40,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:29:40,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-01 22:29:40,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:40,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-10-01 22:29:40,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:29:40,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:29:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:29:40,234 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 12 states. [2019-10-01 22:29:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:40,566 INFO L93 Difference]: Finished difference Result 366 states and 536 transitions. [2019-10-01 22:29:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:29:40,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-01 22:29:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:40,568 INFO L225 Difference]: With dead ends: 366 [2019-10-01 22:29:40,568 INFO L226 Difference]: Without dead ends: 298 [2019-10-01 22:29:40,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=350, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:29:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-01 22:29:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 93. [2019-10-01 22:29:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:29:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-10-01 22:29:40,585 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 44 [2019-10-01 22:29:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:40,585 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-10-01 22:29:40,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:29:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2019-10-01 22:29:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 22:29:40,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:40,587 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:40,587 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash -396829064, now seen corresponding path program 2 times [2019-10-01 22:29:40,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 22:29:40,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,723 INFO L224 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-10-01 22:29:40,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:40,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:40,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:40,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:29:40,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-01 22:29:40,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:40,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-01 22:29:40,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:29:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:29:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:29:40,913 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 17 states. [2019-10-01 22:29:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:41,912 INFO L93 Difference]: Finished difference Result 454 states and 670 transitions. [2019-10-01 22:29:41,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:29:41,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2019-10-01 22:29:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:41,914 INFO L225 Difference]: With dead ends: 454 [2019-10-01 22:29:41,914 INFO L226 Difference]: Without dead ends: 269 [2019-10-01 22:29:41,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=716, Invalid=2040, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:29:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-01 22:29:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 105. [2019-10-01 22:29:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:29:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2019-10-01 22:29:41,939 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 49 [2019-10-01 22:29:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:41,940 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2019-10-01 22:29:41,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:29:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2019-10-01 22:29:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:29:41,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:41,946 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:41,946 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash -611115395, now seen corresponding path program 4 times [2019-10-01 22:29:41,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 51 proven. 19 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-01 22:29:42,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:42,092 INFO L224 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-10-01 22:29:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:42,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:42,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:42,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:29:42,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-01 22:29:42,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:42,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-01 22:29:42,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:29:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:29:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:29:42,271 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 18 states. [2019-10-01 22:29:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:43,159 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2019-10-01 22:29:43,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:29:43,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-10-01 22:29:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:43,162 INFO L225 Difference]: With dead ends: 350 [2019-10-01 22:29:43,162 INFO L226 Difference]: Without dead ends: 266 [2019-10-01 22:29:43,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=734, Invalid=1716, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:29:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-01 22:29:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2019-10-01 22:29:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:29:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2019-10-01 22:29:43,177 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 63 [2019-10-01 22:29:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:43,177 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2019-10-01 22:29:43,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:29:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2019-10-01 22:29:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 22:29:43,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:43,179 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:43,179 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 215199622, now seen corresponding path program 5 times [2019-10-01 22:29:43,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 119 proven. 507 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 22:29:43,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:43,583 INFO L224 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-10-01 22:29:43,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:43,648 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 22:29:43,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:43,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:29:43,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 436 proven. 55 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:43,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 37 [2019-10-01 22:29:43,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:29:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:29:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:29:43,812 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand 37 states. [2019-10-01 22:29:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:47,526 INFO L93 Difference]: Finished difference Result 513 states and 733 transitions. [2019-10-01 22:29:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 22:29:47,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 107 [2019-10-01 22:29:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:47,530 INFO L225 Difference]: With dead ends: 513 [2019-10-01 22:29:47,530 INFO L226 Difference]: Without dead ends: 419 [2019-10-01 22:29:47,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2557, Invalid=10553, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 22:29:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-10-01 22:29:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 205. [2019-10-01 22:29:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 22:29:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2019-10-01 22:29:47,554 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 107 [2019-10-01 22:29:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:47,554 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2019-10-01 22:29:47,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:29:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2019-10-01 22:29:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 22:29:47,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:47,556 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:47,556 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:47,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1872470850, now seen corresponding path program 6 times [2019-10-01 22:29:47,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:47,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:47,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:47,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:47,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 20 proven. 1198 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-10-01 22:29:47,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:47,809 INFO L224 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:47,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:48,002 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:29:48,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:48,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:29:48,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:48,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 0 proven. 1204 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-01 22:29:48,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:48,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 18 [2019-10-01 22:29:48,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:29:48,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:29:48,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:29:48,107 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand 18 states. [2019-10-01 22:29:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:49,042 INFO L93 Difference]: Finished difference Result 331 states and 424 transitions. [2019-10-01 22:29:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:29:49,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2019-10-01 22:29:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:49,045 INFO L225 Difference]: With dead ends: 331 [2019-10-01 22:29:49,045 INFO L226 Difference]: Without dead ends: 318 [2019-10-01 22:29:49,047 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=652, Invalid=1798, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:29:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-01 22:29:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 229. [2019-10-01 22:29:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:29:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 295 transitions. [2019-10-01 22:29:49,072 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 295 transitions. Word has length 137 [2019-10-01 22:29:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:49,072 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 295 transitions. [2019-10-01 22:29:49,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:29:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 295 transitions. [2019-10-01 22:29:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 22:29:49,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:49,077 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 35, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:49,077 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 586009211, now seen corresponding path program 7 times [2019-10-01 22:29:49,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:49,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 672 proven. 159 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2019-10-01 22:29:49,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:49,332 INFO L224 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-10-01 22:29:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:49,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:29:49,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:49,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:49,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-10-01 22:29:49,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:29:49,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:29:49,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:29:49,651 INFO L87 Difference]: Start difference. First operand 229 states and 295 transitions. Second operand 24 states. [2019-10-01 22:29:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:51,673 INFO L93 Difference]: Finished difference Result 487 states and 638 transitions. [2019-10-01 22:29:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 22:29:51,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 161 [2019-10-01 22:29:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:51,679 INFO L225 Difference]: With dead ends: 487 [2019-10-01 22:29:51,679 INFO L226 Difference]: Without dead ends: 281 [2019-10-01 22:29:51,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2104, Invalid=4868, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:29:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-01 22:29:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-10-01 22:29:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-10-01 22:29:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 302 transitions. [2019-10-01 22:29:51,725 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 302 transitions. Word has length 161 [2019-10-01 22:29:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:51,725 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 302 transitions. [2019-10-01 22:29:51,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:29:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 302 transitions. [2019-10-01 22:29:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 22:29:51,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:51,728 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:51,728 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -635882284, now seen corresponding path program 8 times [2019-10-01 22:29:51,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 23 proven. 1975 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-01 22:29:52,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:52,054 INFO L224 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-10-01 22:29:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:52,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:52,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:52,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:29:52,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2019-10-01 22:29:52,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2019-10-01 22:29:52,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:29:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:29:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:29:52,265 INFO L87 Difference]: Start difference. First operand 234 states and 302 transitions. Second operand 19 states. [2019-10-01 22:29:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:53,346 INFO L93 Difference]: Finished difference Result 573 states and 748 transitions. [2019-10-01 22:29:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:29:53,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 166 [2019-10-01 22:29:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:53,349 INFO L225 Difference]: With dead ends: 573 [2019-10-01 22:29:53,349 INFO L226 Difference]: Without dead ends: 364 [2019-10-01 22:29:53,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=824, Invalid=2256, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-01 22:29:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 260. [2019-10-01 22:29:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 22:29:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 336 transitions. [2019-10-01 22:29:53,379 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 336 transitions. Word has length 166 [2019-10-01 22:29:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:53,379 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 336 transitions. [2019-10-01 22:29:53,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:29:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 336 transitions. [2019-10-01 22:29:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:29:53,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:53,382 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 43, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:53,382 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1028235619, now seen corresponding path program 9 times [2019-10-01 22:29:53,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:53,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:53,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3313 backedges. 1115 proven. 1903 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-10-01 22:29:53,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:53,992 INFO L224 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-10-01 22:29:54,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:54,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:29:54,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:54,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:29:54,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:54,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:54,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:54,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3313 backedges. 964 proven. 92 refuted. 0 times theorem prover too weak. 2257 trivial. 0 not checked. [2019-10-01 22:29:54,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:54,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14] total 40 [2019-10-01 22:29:54,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:29:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:29:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:29:54,332 INFO L87 Difference]: Start difference. First operand 260 states and 336 transitions. Second operand 40 states. [2019-10-01 22:30:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:20,009 INFO L93 Difference]: Finished difference Result 1862 states and 2595 transitions. [2019-10-01 22:30:20,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 532 states. [2019-10-01 22:30:20,010 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2019-10-01 22:30:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:20,019 INFO L225 Difference]: With dead ends: 1862 [2019-10-01 22:30:20,020 INFO L226 Difference]: Without dead ends: 1819 [2019-10-01 22:30:20,047 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 564 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144810 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=43124, Invalid=276666, Unknown=0, NotChecked=0, Total=319790 [2019-10-01 22:30:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-10-01 22:30:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 266. [2019-10-01 22:30:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-01 22:30:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2019-10-01 22:30:20,088 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 192 [2019-10-01 22:30:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:20,089 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2019-10-01 22:30:20,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:30:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2019-10-01 22:30:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-01 22:30:20,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:20,092 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:20,092 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -557907377, now seen corresponding path program 10 times [2019-10-01 22:30:20,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:20,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:20,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:20,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3592 backedges. 26 proven. 3079 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2019-10-01 22:30:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:20,395 INFO L224 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-10-01 22:30:20,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:20,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:20,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:20,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:30:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3592 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3492 trivial. 0 not checked. [2019-10-01 22:30:20,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:20,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 20 [2019-10-01 22:30:20,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:30:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:30:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:30:20,676 INFO L87 Difference]: Start difference. First operand 266 states and 344 transitions. Second operand 20 states. [2019-10-01 22:30:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:21,789 INFO L93 Difference]: Finished difference Result 645 states and 843 transitions. [2019-10-01 22:30:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:30:21,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2019-10-01 22:30:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:21,792 INFO L225 Difference]: With dead ends: 645 [2019-10-01 22:30:21,792 INFO L226 Difference]: Without dead ends: 406 [2019-10-01 22:30:21,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=981, Invalid=2679, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:30:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-01 22:30:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 295. [2019-10-01 22:30:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-01 22:30:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 382 transitions. [2019-10-01 22:30:21,821 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 382 transitions. Word has length 198 [2019-10-01 22:30:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:21,821 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 382 transitions. [2019-10-01 22:30:21,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:30:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 382 transitions. [2019-10-01 22:30:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 22:30:21,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:21,824 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 53, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:21,824 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 341402101, now seen corresponding path program 11 times [2019-10-01 22:30:21,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:21,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:21,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4930 backedges. 1867 proven. 2655 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-01 22:30:22,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:22,835 INFO L224 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-10-01 22:30:22,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:23,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 22:30:23,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:23,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:30:23,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:30:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4930 backedges. 3174 proven. 1243 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-10-01 22:30:23,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:23,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 22] total 41 [2019-10-01 22:30:23,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:30:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:30:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1440, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:30:23,521 INFO L87 Difference]: Start difference. First operand 295 states and 382 transitions. Second operand 41 states. [2019-10-01 22:30:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:45,185 INFO L93 Difference]: Finished difference Result 1624 states and 2248 transitions. [2019-10-01 22:30:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2019-10-01 22:30:45,185 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 227 [2019-10-01 22:30:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:45,193 INFO L225 Difference]: With dead ends: 1624 [2019-10-01 22:30:45,193 INFO L226 Difference]: Without dead ends: 1579 [2019-10-01 22:30:45,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114984 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=33840, Invalid=230870, Unknown=0, NotChecked=0, Total=264710 [2019-10-01 22:30:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-10-01 22:30:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 298. [2019-10-01 22:30:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-01 22:30:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 385 transitions. [2019-10-01 22:30:45,256 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 385 transitions. Word has length 227 [2019-10-01 22:30:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:45,256 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 385 transitions. [2019-10-01 22:30:45,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:30:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 385 transitions. [2019-10-01 22:30:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:30:45,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:45,260 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 54, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:45,260 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2080063114, now seen corresponding path program 12 times [2019-10-01 22:30:45,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:45,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:45,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5099 backedges. 1350 proven. 250 refuted. 0 times theorem prover too weak. 3499 trivial. 0 not checked. [2019-10-01 22:30:45,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:45,500 INFO L224 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-10-01 22:30:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:45,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:30:45,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:45,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:30:45,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5099 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 4978 trivial. 0 not checked. [2019-10-01 22:30:46,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:46,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-10-01 22:30:46,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:30:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:30:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:30:46,147 INFO L87 Difference]: Start difference. First operand 298 states and 385 transitions. Second operand 29 states. [2019-10-01 22:30:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:49,695 INFO L93 Difference]: Finished difference Result 660 states and 869 transitions. [2019-10-01 22:30:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-01 22:30:49,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 230 [2019-10-01 22:30:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:49,698 INFO L225 Difference]: With dead ends: 660 [2019-10-01 22:30:49,698 INFO L226 Difference]: Without dead ends: 391 [2019-10-01 22:30:49,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5523 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4675, Invalid=10825, Unknown=0, NotChecked=0, Total=15500 [2019-10-01 22:30:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-10-01 22:30:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 336. [2019-10-01 22:30:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-01 22:30:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 437 transitions. [2019-10-01 22:30:49,737 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 437 transitions. Word has length 230 [2019-10-01 22:30:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:49,737 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 437 transitions. [2019-10-01 22:30:49,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:30:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 437 transitions. [2019-10-01 22:30:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 22:30:49,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:49,740 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 65, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:49,740 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -876509997, now seen corresponding path program 13 times [2019-10-01 22:30:49,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:49,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:49,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7275 backedges. 1815 proven. 303 refuted. 0 times theorem prover too weak. 5157 trivial. 0 not checked. [2019-10-01 22:30:50,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:50,036 INFO L224 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:50,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:50,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:30:50,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7275 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7131 trivial. 0 not checked. [2019-10-01 22:30:50,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:50,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-10-01 22:30:50,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:30:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:30:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:30:50,687 INFO L87 Difference]: Start difference. First operand 336 states and 437 transitions. Second operand 31 states. [2019-10-01 22:30:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:55,032 INFO L93 Difference]: Finished difference Result 740 states and 981 transitions. [2019-10-01 22:30:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-01 22:30:55,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 268 [2019-10-01 22:30:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:55,036 INFO L225 Difference]: With dead ends: 740 [2019-10-01 22:30:55,036 INFO L226 Difference]: Without dead ends: 435 [2019-10-01 22:30:55,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7438 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6064, Invalid=13958, Unknown=0, NotChecked=0, Total=20022 [2019-10-01 22:30:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-01 22:30:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 377. [2019-10-01 22:30:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-01 22:30:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 494 transitions. [2019-10-01 22:30:55,080 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 494 transitions. Word has length 268 [2019-10-01 22:30:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:55,081 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 494 transitions. [2019-10-01 22:30:55,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:30:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 494 transitions. [2019-10-01 22:30:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-01 22:30:55,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:55,083 INFO L411 BasicCegarLoop]: trace histogram [77, 77, 77, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:55,083 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:55,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1942373745, now seen corresponding path program 14 times [2019-10-01 22:30:55,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:55,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10081 backedges. 2376 proven. 361 refuted. 0 times theorem prover too weak. 7344 trivial. 0 not checked. [2019-10-01 22:30:55,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:55,470 INFO L224 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-10-01 22:30:55,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:55,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:55,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:55,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:30:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10081 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 9912 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:56,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:56,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-10-01 22:30:56,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:30:56,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:30:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:30:56,215 INFO L87 Difference]: Start difference. First operand 377 states and 494 transitions. Second operand 33 states. [2019-10-01 22:31:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:01,722 INFO L93 Difference]: Finished difference Result 826 states and 1103 transitions. [2019-10-01 22:31:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-01 22:31:01,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 309 [2019-10-01 22:31:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:01,729 INFO L225 Difference]: With dead ends: 826 [2019-10-01 22:31:01,729 INFO L226 Difference]: Without dead ends: 482 [2019-10-01 22:31:01,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7735, Invalid=17705, Unknown=0, NotChecked=0, Total=25440 [2019-10-01 22:31:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-01 22:31:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 421. [2019-10-01 22:31:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-01 22:31:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 556 transitions. [2019-10-01 22:31:01,776 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 556 transitions. Word has length 309 [2019-10-01 22:31:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:01,777 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 556 transitions. [2019-10-01 22:31:01,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:31:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 556 transitions. [2019-10-01 22:31:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-01 22:31:01,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:01,780 INFO L411 BasicCegarLoop]: trace histogram [90, 90, 90, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:01,780 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1230882070, now seen corresponding path program 15 times [2019-10-01 22:31:01,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:01,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:01,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13628 backedges. 3042 proven. 424 refuted. 0 times theorem prover too weak. 10162 trivial. 0 not checked. [2019-10-01 22:31:02,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:02,146 INFO L224 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:02,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:31:02,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:02,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:31:02,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13628 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 13432 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:31:03,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-10-01 22:31:03,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:31:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:31:03,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:31:03,112 INFO L87 Difference]: Start difference. First operand 421 states and 556 transitions. Second operand 35 states. [2019-10-01 22:31:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:09,363 INFO L93 Difference]: Finished difference Result 918 states and 1235 transitions. [2019-10-01 22:31:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-10-01 22:31:09,363 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 353 [2019-10-01 22:31:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:09,366 INFO L225 Difference]: With dead ends: 918 [2019-10-01 22:31:09,367 INFO L226 Difference]: Without dead ends: 532 [2019-10-01 22:31:09,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12675 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9723, Invalid=22139, Unknown=0, NotChecked=0, Total=31862 [2019-10-01 22:31:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-01 22:31:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 468. [2019-10-01 22:31:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-01 22:31:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 623 transitions. [2019-10-01 22:31:09,421 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 623 transitions. Word has length 353 [2019-10-01 22:31:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:09,421 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 623 transitions. [2019-10-01 22:31:09,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:31:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2019-10-01 22:31:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-01 22:31:09,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:09,424 INFO L411 BasicCegarLoop]: trace histogram [104, 104, 104, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:09,425 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1069634738, now seen corresponding path program 16 times [2019-10-01 22:31:09,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:09,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:09,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:09,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18036 backedges. 3822 proven. 492 refuted. 0 times theorem prover too weak. 13722 trivial. 0 not checked. [2019-10-01 22:31:09,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:09,881 INFO L224 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:10,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:10,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:10,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:31:10,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18036 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 17811 trivial. 0 not checked. [2019-10-01 22:31:10,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:10,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2019-10-01 22:31:10,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:31:10,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:31:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:31:10,545 INFO L87 Difference]: Start difference. First operand 468 states and 623 transitions. Second operand 37 states. [2019-10-01 22:31:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:17,934 INFO L93 Difference]: Finished difference Result 1016 states and 1377 transitions. [2019-10-01 22:31:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-10-01 22:31:17,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 400 [2019-10-01 22:31:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:17,939 INFO L225 Difference]: With dead ends: 1016 [2019-10-01 22:31:17,939 INFO L226 Difference]: Without dead ends: 585 [2019-10-01 22:31:17,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16127 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12065, Invalid=27337, Unknown=0, NotChecked=0, Total=39402 [2019-10-01 22:31:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-01 22:31:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2019-10-01 22:31:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-01 22:31:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 695 transitions. [2019-10-01 22:31:17,996 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 695 transitions. Word has length 400 [2019-10-01 22:31:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:17,996 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 695 transitions. [2019-10-01 22:31:17,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:31:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 695 transitions. [2019-10-01 22:31:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-10-01 22:31:18,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:18,001 INFO L411 BasicCegarLoop]: trace histogram [119, 119, 119, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:18,001 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1791777349, now seen corresponding path program 17 times [2019-10-01 22:31:18,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:18,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:18,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:18,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:18,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23434 backedges. 4725 proven. 565 refuted. 0 times theorem prover too weak. 18144 trivial. 0 not checked. [2019-10-01 22:31:18,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:18,495 INFO L224 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-10-01 22:31:18,619 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:31:19,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-10-01 22:31:19,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:19,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:31:19,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23434 backedges. 15836 proven. 5750 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-01 22:31:20,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:20,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 34] total 54 [2019-10-01 22:31:20,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:31:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:31:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2504, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:31:20,502 INFO L87 Difference]: Start difference. First operand 518 states and 695 transitions. Second operand 54 states. [2019-10-01 22:31:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:47,029 INFO L93 Difference]: Finished difference Result 5557 states and 7955 transitions. [2019-10-01 22:31:47,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 519 states. [2019-10-01 22:31:47,029 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 450 [2019-10-01 22:31:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:47,051 INFO L225 Difference]: With dead ends: 5557 [2019-10-01 22:31:47,052 INFO L226 Difference]: Without dead ends: 5138 [2019-10-01 22:31:47,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1315 GetRequests, 746 SyntacticMatches, 1 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134596 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=42174, Invalid=282156, Unknown=0, NotChecked=0, Total=324330 [2019-10-01 22:31:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2019-10-01 22:31:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 1413. [2019-10-01 22:31:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-10-01 22:31:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1871 transitions. [2019-10-01 22:31:47,293 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1871 transitions. Word has length 450 [2019-10-01 22:31:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:47,294 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 1871 transitions. [2019-10-01 22:31:47,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:31:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1871 transitions. [2019-10-01 22:31:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-01 22:31:47,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:47,300 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 120, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:47,301 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2130724750, now seen corresponding path program 18 times [2019-10-01 22:31:47,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:47,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 23806 backedges. 44 proven. 21736 refuted. 0 times theorem prover too weak. 2026 trivial. 0 not checked. [2019-10-01 22:31:47,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:47,887 INFO L224 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-10-01 22:31:48,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:31:49,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:31:49,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:49,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:31:49,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23806 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 23550 trivial. 0 not checked. [2019-10-01 22:31:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 26 [2019-10-01 22:31:49,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:31:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:31:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:31:49,295 INFO L87 Difference]: Start difference. First operand 1413 states and 1871 transitions. Second operand 26 states. [2019-10-01 22:31:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:51,411 INFO L93 Difference]: Finished difference Result 3109 states and 4117 transitions. [2019-10-01 22:31:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:31:51,411 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 453 [2019-10-01 22:31:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:51,416 INFO L225 Difference]: With dead ends: 3109 [2019-10-01 22:31:51,417 INFO L226 Difference]: Without dead ends: 1735 [2019-10-01 22:31:51,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2217, Invalid=5973, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 22:31:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-10-01 22:31:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1463. [2019-10-01 22:31:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2019-10-01 22:31:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 1937 transitions. [2019-10-01 22:31:51,595 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 1937 transitions. Word has length 453 [2019-10-01 22:31:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:51,595 INFO L475 AbstractCegarLoop]: Abstraction has 1463 states and 1937 transitions. [2019-10-01 22:31:51,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:31:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1937 transitions. [2019-10-01 22:31:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-10-01 22:31:51,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:51,601 INFO L411 BasicCegarLoop]: trace histogram [135, 135, 135, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:51,601 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1733619383, now seen corresponding path program 19 times [2019-10-01 22:31:51,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:51,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:51,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29960 backedges. 5760 proven. 643 refuted. 0 times theorem prover too weak. 23557 trivial. 0 not checked. [2019-10-01 22:31:52,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:52,173 INFO L224 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-10-01 22:31:52,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:52,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:31:52,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29960 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 29671 trivial. 0 not checked. [2019-10-01 22:31:53,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:53,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2019-10-01 22:31:53,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:31:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:31:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:31:53,121 INFO L87 Difference]: Start difference. First operand 1463 states and 1937 transitions. Second operand 41 states. [2019-10-01 22:32:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:03,372 INFO L93 Difference]: Finished difference Result 3109 states and 4135 transitions. [2019-10-01 22:32:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-10-01 22:32:03,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 503 [2019-10-01 22:32:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:03,380 INFO L225 Difference]: With dead ends: 3109 [2019-10-01 22:32:03,380 INFO L226 Difference]: Without dead ends: 1687 [2019-10-01 22:32:03,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25053 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17969, Invalid=40353, Unknown=0, NotChecked=0, Total=58322 [2019-10-01 22:32:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-10-01 22:32:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1519. [2019-10-01 22:32:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-10-01 22:32:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2013 transitions. [2019-10-01 22:32:03,537 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2013 transitions. Word has length 503 [2019-10-01 22:32:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:03,537 INFO L475 AbstractCegarLoop]: Abstraction has 1519 states and 2013 transitions. [2019-10-01 22:32:03,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:32:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2013 transitions. [2019-10-01 22:32:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-10-01 22:32:03,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:03,544 INFO L411 BasicCegarLoop]: trace histogram [152, 152, 152, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:03,544 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1905621038, now seen corresponding path program 20 times [2019-10-01 22:32:03,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:03,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:03,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:32:03,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 6936 proven. 726 refuted. 0 times theorem prover too weak. 30099 trivial. 0 not checked. [2019-10-01 22:32:04,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:04,228 INFO L224 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-10-01 22:32:04,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:32:04,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:32:04,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:04,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:32:04,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 37437 trivial. 0 not checked. [2019-10-01 22:32:05,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:05,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-10-01 22:32:05,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:32:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:32:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:32:05,311 INFO L87 Difference]: Start difference. First operand 1519 states and 2013 transitions. Second operand 43 states. [2019-10-01 22:32:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:17,337 INFO L93 Difference]: Finished difference Result 3225 states and 4295 transitions. [2019-10-01 22:32:17,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-10-01 22:32:17,337 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 559 [2019-10-01 22:32:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:17,345 INFO L225 Difference]: With dead ends: 3225 [2019-10-01 22:32:17,345 INFO L226 Difference]: Without dead ends: 1749 [2019-10-01 22:32:17,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30681 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=21615, Invalid=48345, Unknown=0, NotChecked=0, Total=69960 [2019-10-01 22:32:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-10-01 22:32:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1578. [2019-10-01 22:32:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2019-10-01 22:32:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2094 transitions. [2019-10-01 22:32:17,500 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2094 transitions. Word has length 559 [2019-10-01 22:32:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:17,500 INFO L475 AbstractCegarLoop]: Abstraction has 1578 states and 2094 transitions. [2019-10-01 22:32:17,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:32:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2094 transitions. [2019-10-01 22:32:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-10-01 22:32:17,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:17,508 INFO L411 BasicCegarLoop]: trace histogram [170, 170, 170, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:17,508 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1048192986, now seen corresponding path program 21 times [2019-10-01 22:32:17,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:17,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 46993 backedges. 8262 proven. 814 refuted. 0 times theorem prover too weak. 37917 trivial. 0 not checked. [2019-10-01 22:32:18,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:18,182 INFO L224 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-10-01 22:32:18,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:32:20,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-01 22:32:20,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:20,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:32:20,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 46993 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 46632 trivial. 0 not checked. [2019-10-01 22:32:20,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:20,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2019-10-01 22:32:20,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:32:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:32:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1558, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:32:20,961 INFO L87 Difference]: Start difference. First operand 1578 states and 2094 transitions. Second operand 45 states. [2019-10-01 22:32:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:34,975 INFO L93 Difference]: Finished difference Result 3347 states and 4465 transitions. [2019-10-01 22:32:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-10-01 22:32:34,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 618 [2019-10-01 22:32:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:34,981 INFO L225 Difference]: With dead ends: 3347 [2019-10-01 22:32:34,982 INFO L226 Difference]: Without dead ends: 1814 [2019-10-01 22:32:34,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37195 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=25783, Invalid=57449, Unknown=0, NotChecked=0, Total=83232 [2019-10-01 22:32:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-10-01 22:32:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1640. [2019-10-01 22:32:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2019-10-01 22:32:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2180 transitions. [2019-10-01 22:32:35,172 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2180 transitions. Word has length 618 [2019-10-01 22:32:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:35,172 INFO L475 AbstractCegarLoop]: Abstraction has 1640 states and 2180 transitions. [2019-10-01 22:32:35,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:32:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2180 transitions. [2019-10-01 22:32:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2019-10-01 22:32:35,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:35,180 INFO L411 BasicCegarLoop]: trace histogram [189, 189, 189, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:35,181 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash 716783523, now seen corresponding path program 22 times [2019-10-01 22:32:35,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:35,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:35,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 57821 backedges. 9747 proven. 907 refuted. 0 times theorem prover too weak. 47167 trivial. 0 not checked. [2019-10-01 22:32:35,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:35,931 INFO L224 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-10-01 22:32:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:32:36,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:32:36,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:36,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:32:36,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 57821 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 57421 trivial. 0 not checked. [2019-10-01 22:32:37,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:37,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2019-10-01 22:32:37,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:32:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:32:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:32:37,197 INFO L87 Difference]: Start difference. First operand 1640 states and 2180 transitions. Second operand 47 states. [2019-10-01 22:32:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:53,312 INFO L93 Difference]: Finished difference Result 3475 states and 4645 transitions. [2019-10-01 22:32:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2019-10-01 22:32:53,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 680 [2019-10-01 22:32:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:53,318 INFO L225 Difference]: With dead ends: 3475 [2019-10-01 22:32:53,319 INFO L226 Difference]: Without dead ends: 1882 [2019-10-01 22:32:53,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44682 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=30520, Invalid=67762, Unknown=0, NotChecked=0, Total=98282 [2019-10-01 22:32:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-01 22:32:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1705. [2019-10-01 22:32:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-10-01 22:32:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2271 transitions. [2019-10-01 22:32:53,464 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2271 transitions. Word has length 680 [2019-10-01 22:32:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:53,465 INFO L475 AbstractCegarLoop]: Abstraction has 1705 states and 2271 transitions. [2019-10-01 22:32:53,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:32:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2271 transitions. [2019-10-01 22:32:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-10-01 22:32:53,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:53,473 INFO L411 BasicCegarLoop]: trace histogram [209, 209, 209, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:53,474 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -12875743, now seen corresponding path program 23 times [2019-10-01 22:32:53,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:53,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:53,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 70419 backedges. 11400 proven. 1005 refuted. 0 times theorem prover too weak. 58014 trivial. 0 not checked. [2019-10-01 22:32:54,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:54,430 INFO L224 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-10-01 22:32:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:33:00,442 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 89 check-sat command(s) [2019-10-01 22:33:00,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:00,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:33:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 70419 backedges. 51982 proven. 13775 refuted. 0 times theorem prover too weak. 4662 trivial. 0 not checked. [2019-10-01 22:33:02,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:02,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 44] total 69 [2019-10-01 22:33:02,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 22:33:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 22:33:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=4097, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:33:02,349 INFO L87 Difference]: Start difference. First operand 1705 states and 2271 transitions. Second operand 69 states. [2019-10-01 22:33:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:55,244 INFO L93 Difference]: Finished difference Result 20520 states and 29015 transitions. [2019-10-01 22:33:55,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 862 states. [2019-10-01 22:33:55,244 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 745 [2019-10-01 22:33:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:55,292 INFO L225 Difference]: With dead ends: 20520 [2019-10-01 22:33:55,292 INFO L226 Difference]: Without dead ends: 19056 [2019-10-01 22:33:55,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2186 GetRequests, 1238 SyntacticMatches, 22 SemanticMatches, 926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377489 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=100668, Invalid=759588, Unknown=0, NotChecked=0, Total=860256 [2019-10-01 22:33:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19056 states. [2019-10-01 22:33:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19056 to 3590. [2019-10-01 22:33:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-10-01 22:33:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4775 transitions. [2019-10-01 22:33:55,762 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4775 transitions. Word has length 745 [2019-10-01 22:33:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:55,763 INFO L475 AbstractCegarLoop]: Abstraction has 3590 states and 4775 transitions. [2019-10-01 22:33:55,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 22:33:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4775 transitions. [2019-10-01 22:33:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-10-01 22:33:55,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:55,774 INFO L411 BasicCegarLoop]: trace histogram [210, 210, 210, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:55,774 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1820521548, now seen corresponding path program 24 times [2019-10-01 22:33:55,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:55,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:55,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:55,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 71066 backedges. 59 proven. 66406 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2019-10-01 22:33:56,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:56,849 INFO L224 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-10-01 22:33:57,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:34:02,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-01 22:34:02,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:02,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:34:02,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 71066 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 70625 trivial. 0 not checked. [2019-10-01 22:34:02,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 31 [2019-10-01 22:34:02,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:34:02,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:34:02,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=633, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:34:02,294 INFO L87 Difference]: Start difference. First operand 3590 states and 4775 transitions. Second operand 31 states. [2019-10-01 22:34:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:05,643 INFO L93 Difference]: Finished difference Result 7682 states and 10206 transitions. [2019-10-01 22:34:05,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-01 22:34:05,644 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 748 [2019-10-01 22:34:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:05,653 INFO L225 Difference]: With dead ends: 7682 [2019-10-01 22:34:05,653 INFO L226 Difference]: Without dead ends: 4141 [2019-10-01 22:34:05,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4073 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3632, Invalid=9708, Unknown=0, NotChecked=0, Total=13340 [2019-10-01 22:34:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2019-10-01 22:34:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3655. [2019-10-01 22:34:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2019-10-01 22:34:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4861 transitions. [2019-10-01 22:34:06,192 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4861 transitions. Word has length 748 [2019-10-01 22:34:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:06,193 INFO L475 AbstractCegarLoop]: Abstraction has 3655 states and 4861 transitions. [2019-10-01 22:34:06,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:34:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4861 transitions. [2019-10-01 22:34:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-10-01 22:34:06,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:06,204 INFO L411 BasicCegarLoop]: trace histogram [230, 230, 230, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:06,204 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash -408135098, now seen corresponding path program 25 times [2019-10-01 22:34:06,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:06,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:06,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 84970 backedges. 13230 proven. 1108 refuted. 0 times theorem prover too weak. 70632 trivial. 0 not checked. [2019-10-01 22:34:07,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:07,257 INFO L224 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-10-01 22:34:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:34:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:08,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 3102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:34:08,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 84970 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 84486 trivial. 0 not checked. [2019-10-01 22:34:08,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:08,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2019-10-01 22:34:08,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:34:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:34:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1999, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:34:08,813 INFO L87 Difference]: Start difference. First operand 3655 states and 4861 transitions. Second operand 51 states. [2019-10-01 22:34:12,655 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-10-01 22:34:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:30,704 INFO L93 Difference]: Finished difference Result 7647 states and 10191 transitions. [2019-10-01 22:34:30,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2019-10-01 22:34:30,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 813 [2019-10-01 22:34:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:30,714 INFO L225 Difference]: With dead ends: 7647 [2019-10-01 22:34:30,714 INFO L226 Difference]: Without dead ends: 4043 [2019-10-01 22:34:30,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1066 SyntacticMatches, 0 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62943 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=41899, Invalid=92423, Unknown=0, NotChecked=0, Total=134322 [2019-10-01 22:34:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2019-10-01 22:34:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 3726. [2019-10-01 22:34:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2019-10-01 22:34:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 4957 transitions. [2019-10-01 22:34:31,421 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 4957 transitions. Word has length 813 [2019-10-01 22:34:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:31,422 INFO L475 AbstractCegarLoop]: Abstraction has 3726 states and 4957 transitions. [2019-10-01 22:34:31,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:34:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 4957 transitions. [2019-10-01 22:34:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2019-10-01 22:34:31,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:31,432 INFO L411 BasicCegarLoop]: trace histogram [252, 252, 252, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:31,432 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2122586110, now seen corresponding path program 26 times [2019-10-01 22:34:31,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:31,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:31,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:34:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 101666 backedges. 15246 proven. 1216 refuted. 0 times theorem prover too weak. 85204 trivial. 0 not checked. [2019-10-01 22:34:32,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:32,573 INFO L224 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:32,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:34:33,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:34:33,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:33,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:34:33,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 101666 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 101137 trivial. 0 not checked. [2019-10-01 22:34:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 53 [2019-10-01 22:34:34,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:34:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:34:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=2158, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:34:34,297 INFO L87 Difference]: Start difference. First operand 3726 states and 4957 transitions. Second operand 53 states. [2019-10-01 22:34:41,085 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-10-01 22:34:52,273 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-10-01 22:34:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:58,591 INFO L93 Difference]: Finished difference Result 7793 states and 10391 transitions. [2019-10-01 22:34:58,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2019-10-01 22:34:58,592 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 884 [2019-10-01 22:34:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:58,599 INFO L225 Difference]: With dead ends: 7793 [2019-10-01 22:34:58,600 INFO L226 Difference]: Without dead ends: 4120 [2019-10-01 22:34:58,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1553 GetRequests, 1160 SyntacticMatches, 0 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73911 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=48645, Invalid=106985, Unknown=0, NotChecked=0, Total=155630 [2019-10-01 22:34:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-10-01 22:34:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 3800. [2019-10-01 22:34:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2019-10-01 22:34:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5058 transitions. [2019-10-01 22:34:59,041 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5058 transitions. Word has length 884 [2019-10-01 22:34:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:59,041 INFO L475 AbstractCegarLoop]: Abstraction has 3800 states and 5058 transitions. [2019-10-01 22:34:59,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:34:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5058 transitions. [2019-10-01 22:34:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2019-10-01 22:34:59,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:59,051 INFO L411 BasicCegarLoop]: trace histogram [275, 275, 275, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:59,051 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1885404533, now seen corresponding path program 27 times [2019-10-01 22:34:59,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:59,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:59,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 120708 backedges. 17457 proven. 1329 refuted. 0 times theorem prover too weak. 101922 trivial. 0 not checked. [2019-10-01 22:35:00,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:00,508 INFO L224 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) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:35:05,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-01 22:35:05,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:05,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:35:05,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:06,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 120708 backedges. 17549 proven. 715 refuted. 0 times theorem prover too weak. 102444 trivial. 0 not checked. [2019-10-01 22:35:06,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 36 [2019-10-01 22:35:06,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:35:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:35:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=920, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:35:06,431 INFO L87 Difference]: Start difference. First operand 3800 states and 5058 transitions. Second operand 36 states. [2019-10-01 22:35:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:11,218 INFO L93 Difference]: Finished difference Result 13949 states and 19565 transitions. [2019-10-01 22:35:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 22:35:11,219 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 958 [2019-10-01 22:35:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:11,235 INFO L225 Difference]: With dead ends: 13949 [2019-10-01 22:35:11,235 INFO L226 Difference]: Without dead ends: 13936 [2019-10-01 22:35:11,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3368 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3684, Invalid=8088, Unknown=0, NotChecked=0, Total=11772 [2019-10-01 22:35:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13936 states. [2019-10-01 22:35:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13936 to 3806. [2019-10-01 22:35:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2019-10-01 22:35:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 5068 transitions. [2019-10-01 22:35:11,750 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 5068 transitions. Word has length 958 [2019-10-01 22:35:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:11,751 INFO L475 AbstractCegarLoop]: Abstraction has 3806 states and 5068 transitions. [2019-10-01 22:35:11,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:35:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 5068 transitions. [2019-10-01 22:35:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2019-10-01 22:35:11,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:11,760 INFO L411 BasicCegarLoop]: trace histogram [277, 277, 277, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:11,760 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash 369141053, now seen corresponding path program 28 times [2019-10-01 22:35:11,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:11,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:11,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 122407 backedges. 783 proven. 115395 refuted. 0 times theorem prover too weak. 6229 trivial. 0 not checked. [2019-10-01 22:35:13,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:13,925 INFO L224 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:14,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:35:14,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:35:14,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:14,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 3692 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:35:14,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 122407 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 121831 trivial. 0 not checked. [2019-10-01 22:35:15,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:15,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 27] total 57 [2019-10-01 22:35:15,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:35:15,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:35:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=2519, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:35:15,349 INFO L87 Difference]: Start difference. First operand 3806 states and 5068 transitions. Second operand 57 states. [2019-10-01 22:35:24,001 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-10-01 22:35:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:26,311 INFO L93 Difference]: Finished difference Result 8821 states and 11751 transitions. [2019-10-01 22:35:26,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2019-10-01 22:35:26,311 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 964 [2019-10-01 22:35:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:26,316 INFO L225 Difference]: With dead ends: 8821 [2019-10-01 22:35:26,316 INFO L226 Difference]: Without dead ends: 5070 [2019-10-01 22:35:26,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44098 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=27096, Invalid=67460, Unknown=0, NotChecked=0, Total=94556 [2019-10-01 22:35:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2019-10-01 22:35:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 3940. [2019-10-01 22:35:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2019-10-01 22:35:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5248 transitions. [2019-10-01 22:35:26,840 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5248 transitions. Word has length 964 [2019-10-01 22:35:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:26,841 INFO L475 AbstractCegarLoop]: Abstraction has 3940 states and 5248 transitions. [2019-10-01 22:35:26,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:35:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5248 transitions. [2019-10-01 22:35:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2019-10-01 22:35:26,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:26,851 INFO L411 BasicCegarLoop]: trace histogram [297, 297, 297, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:26,851 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1256922965, now seen corresponding path program 29 times [2019-10-01 22:35:26,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:26,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 140473 backedges. 83946 proven. 50919 refuted. 0 times theorem prover too weak. 5608 trivial. 0 not checked. [2019-10-01 22:35:30,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:30,643 INFO L224 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-10-01 22:35:30,944 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:35:33,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 109 check-sat command(s) [2019-10-01 22:35:33,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:33,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:35:33,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:33,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 140473 backedges. 113509 proven. 15363 refuted. 0 times theorem prover too weak. 11601 trivial. 0 not checked. [2019-10-01 22:35:33,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:33,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 46] total 106 [2019-10-01 22:35:33,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-10-01 22:35:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-10-01 22:35:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=9953, Unknown=0, NotChecked=0, Total=11130 [2019-10-01 22:35:33,966 INFO L87 Difference]: Start difference. First operand 3940 states and 5248 transitions. Second operand 106 states. [2019-10-01 22:37:47,213 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-10-01 22:37:59,375 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-10-01 22:39:40,845 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-10-01 22:40:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:48,541 INFO L93 Difference]: Finished difference Result 44246 states and 62024 transitions. [2019-10-01 22:40:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3006 states. [2019-10-01 22:40:48,541 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 1029 [2019-10-01 22:40:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:48,577 INFO L225 Difference]: With dead ends: 44246 [2019-10-01 22:40:48,578 INFO L226 Difference]: Without dead ends: 22075 [2019-10-01 22:40:49,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5936 GetRequests, 2828 SyntacticMatches, 4 SemanticMatches, 3104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565771 ImplicationChecksByTransitivity, 278.4s TimeCoverageRelationStatistics Valid=992262, Invalid=8651868, Unknown=0, NotChecked=0, Total=9644130 [2019-10-01 22:40:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22075 states. [2019-10-01 22:40:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22075 to 3263. [2019-10-01 22:40:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3263 states. [2019-10-01 22:40:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 4332 transitions. [2019-10-01 22:40:50,249 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 4332 transitions. Word has length 1029 [2019-10-01 22:40:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:50,249 INFO L475 AbstractCegarLoop]: Abstraction has 3263 states and 4332 transitions. [2019-10-01 22:40:50,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-10-01 22:40:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 4332 transitions. [2019-10-01 22:40:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-10-01 22:40:50,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:50,259 INFO L411 BasicCegarLoop]: trace histogram [299, 299, 299, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:50,260 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1275168263, now seen corresponding path program 30 times [2019-10-01 22:40:50,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:50,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 142306 backedges. 19872 proven. 1447 refuted. 0 times theorem prover too weak. 120987 trivial. 0 not checked. [2019-10-01 22:40:51,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:51,996 INFO L224 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-10-01 22:40:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:41:02,967 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-10-01 22:41:02,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:02,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:41:02,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:03,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:03,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:03,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:03,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 142306 backedges. 19919 proven. 782 refuted. 0 times theorem prover too weak. 121605 trivial. 0 not checked. [2019-10-01 22:41:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 35 [2019-10-01 22:41:04,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:41:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:41:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=834, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:41:04,009 INFO L87 Difference]: Start difference. First operand 3263 states and 4332 transitions. Second operand 35 states. [2019-10-01 22:41:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:09,944 INFO L93 Difference]: Finished difference Result 12211 states and 17176 transitions. [2019-10-01 22:41:09,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 22:41:09,944 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1035 [2019-10-01 22:41:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:09,958 INFO L225 Difference]: With dead ends: 12211 [2019-10-01 22:41:09,958 INFO L226 Difference]: Without dead ends: 12198 [2019-10-01 22:41:09,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3644, Invalid=8128, Unknown=0, NotChecked=0, Total=11772 [2019-10-01 22:41:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2019-10-01 22:41:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 3266. [2019-10-01 22:41:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2019-10-01 22:41:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4337 transitions. [2019-10-01 22:41:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4337 transitions. Word has length 1035 [2019-10-01 22:41:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:10,420 INFO L475 AbstractCegarLoop]: Abstraction has 3266 states and 4337 transitions. [2019-10-01 22:41:10,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:41:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4337 transitions. [2019-10-01 22:41:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2019-10-01 22:41:10,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:10,431 INFO L411 BasicCegarLoop]: trace histogram [300, 300, 300, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:10,431 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -697265292, now seen corresponding path program 31 times [2019-10-01 22:41:10,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:10,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 143227 backedges. 71 proven. 135379 refuted. 0 times theorem prover too weak. 7777 trivial. 0 not checked. [2019-10-01 22:41:11,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:11,943 INFO L224 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-10-01 22:41:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:12,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 3981 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:41:12,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 143227 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 142602 trivial. 0 not checked. [2019-10-01 22:41:13,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:13,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 35 [2019-10-01 22:41:13,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:41:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:41:13,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=791, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:41:13,405 INFO L87 Difference]: Start difference. First operand 3266 states and 4337 transitions. Second operand 35 states. [2019-10-01 22:41:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:17,262 INFO L93 Difference]: Finished difference Result 6977 states and 9258 transitions. [2019-10-01 22:41:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-10-01 22:41:17,262 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1038 [2019-10-01 22:41:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:17,266 INFO L225 Difference]: With dead ends: 6977 [2019-10-01 22:41:17,266 INFO L226 Difference]: Without dead ends: 3768 [2019-10-01 22:41:17,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 1058 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5699 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5016, Invalid=13344, Unknown=0, NotChecked=0, Total=18360 [2019-10-01 22:41:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2019-10-01 22:41:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3340. [2019-10-01 22:41:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2019-10-01 22:41:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 4435 transitions. [2019-10-01 22:41:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 4435 transitions. Word has length 1038 [2019-10-01 22:41:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:17,705 INFO L475 AbstractCegarLoop]: Abstraction has 3340 states and 4435 transitions. [2019-10-01 22:41:17,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:41:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 4435 transitions. [2019-10-01 22:41:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2019-10-01 22:41:17,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:17,715 INFO L411 BasicCegarLoop]: trace histogram [323, 323, 323, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:17,715 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1416944701, now seen corresponding path program 32 times [2019-10-01 22:41:17,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:17,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 165685 backedges. 113767 proven. 44895 refuted. 0 times theorem prover too weak. 7023 trivial. 0 not checked. [2019-10-01 22:41:20,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:20,751 INFO L224 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-10-01 22:41:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:41:21,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:41:21,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:21,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 4270 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:41:21,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 165685 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 165009 trivial. 0 not checked. [2019-10-01 22:41:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 29] total 110 [2019-10-01 22:41:23,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-10-01 22:41:23,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-10-01 22:41:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=10602, Unknown=0, NotChecked=0, Total=11990 [2019-10-01 22:41:23,444 INFO L87 Difference]: Start difference. First operand 3340 states and 4435 transitions. Second operand 110 states. [2019-10-01 22:42:03,313 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16