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/recursive/gcd02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:12:47,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:12:47,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:12:47,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:12:47,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:12:47,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:12:47,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:12:47,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:12:47,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:12:47,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:12:47,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:12:47,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:12:47,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:12:47,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:12:47,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:12:47,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:12:47,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:12:47,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:12:47,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:12:47,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:12:47,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:12:47,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:12:47,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:12:47,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:12:47,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:12:47,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:12:47,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:12:47,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:12:47,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:12:47,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:12:47,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:12:47,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:12:47,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:12:47,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:12:47,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:12:47,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:12:47,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:12:47,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:12:47,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:12:47,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:12:47,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:12:47,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:12:47,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:12:47,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:12:47,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:12:47,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:12:47,616 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:12:47,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:12:47,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:12:47,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:12:47,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:12:47,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:12:47,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:12:47,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:12:47,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:12:47,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:12:47,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:12:47,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:12:47,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:47,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:12:47,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:12:47,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:12:47,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:12:47,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:12:47,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:12:47,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:12:47,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:12:47,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:12:47,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:12:47,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:12:47,669 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:12:47,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/gcd02.c [2019-09-08 06:12:47,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3160787a8/b1012c70fb9047f7833fb1f142ad2422/FLAGf8e8807ac [2019-09-08 06:12:48,188 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:12:48,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd02.c [2019-09-08 06:12:48,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3160787a8/b1012c70fb9047f7833fb1f142ad2422/FLAGf8e8807ac [2019-09-08 06:12:48,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3160787a8/b1012c70fb9047f7833fb1f142ad2422 [2019-09-08 06:12:48,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:12:48,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:12:48,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:48,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:12:48,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:12:48,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48, skipping insertion in model container [2019-09-08 06:12:48,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:12:48,619 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:12:48,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:48,780 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:12:48,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:48,811 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:12:48,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48 WrapperNode [2019-09-08 06:12:48,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:48,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:12:48,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:12:48,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:12:48,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:12:48,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:12:48,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:12:48,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:12:48,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:48,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:12:48,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:12:48,988 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-09-08 06:12:48,988 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2019-09-08 06:12:48,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:12:48,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:12:48,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:12:48,988 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-09-08 06:12:48,989 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2019-09-08 06:12:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:12:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:12:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:12:49,250 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:12:49,250 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:12:49,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:49 BoogieIcfgContainer [2019-09-08 06:12:49,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:12:49,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:12:49,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:12:49,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:12:49,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:12:48" (1/3) ... [2019-09-08 06:12:49,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381dd4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:49, skipping insertion in model container [2019-09-08 06:12:49,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (2/3) ... [2019-09-08 06:12:49,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381dd4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:49, skipping insertion in model container [2019-09-08 06:12:49,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:49" (3/3) ... [2019-09-08 06:12:49,266 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd02.c [2019-09-08 06:12:49,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:12:49,290 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 06:12:49,305 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 06:12:49,342 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:12:49,344 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:12:49,344 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:12:49,344 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:12:49,345 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:12:49,345 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:12:49,345 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:12:49,345 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:12:49,345 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:12:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-08 06:12:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 06:12:49,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:49,373 INFO L418 AbstractCegarLoop]: === Iteration 1 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 914604162, now seen corresponding path program 1 times [2019-09-08 06:12:49,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:49,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:12:49,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:12:49,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:12:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:49,631 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2019-09-08 06:12:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:49,809 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2019-09-08 06:12:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:49,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-08 06:12:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:49,827 INFO L225 Difference]: With dead ends: 81 [2019-09-08 06:12:49,827 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 06:12:49,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 06:12:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 06:12:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 06:12:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-08 06:12:49,940 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 12 [2019-09-08 06:12:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:49,940 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-08 06:12:49,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:12:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-08 06:12:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 06:12:49,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,944 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:49,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash -72116413, now seen corresponding path program 1 times [2019-09-08 06:12:49,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:50,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:50,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 06:12:50,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:12:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:12:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:50,131 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 7 states. [2019-09-08 06:12:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:50,318 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2019-09-08 06:12:50,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:12:50,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-08 06:12:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:50,323 INFO L225 Difference]: With dead ends: 68 [2019-09-08 06:12:50,324 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 06:12:50,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:12:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 06:12:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2019-09-08 06:12:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 06:12:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-08 06:12:50,345 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2019-09-08 06:12:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:50,345 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-08 06:12:50,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:12:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-08 06:12:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 06:12:50,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:50,347 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:50,348 INFO L418 AbstractCegarLoop]: === Iteration 3 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash -74946558, now seen corresponding path program 1 times [2019-09-08 06:12:50,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:50,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:50,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:50,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:50,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:12:50,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:12:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:12:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:50,429 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2019-09-08 06:12:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:50,561 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2019-09-08 06:12:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:50,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-08 06:12:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:50,564 INFO L225 Difference]: With dead ends: 60 [2019-09-08 06:12:50,565 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 06:12:50,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 06:12:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-09-08 06:12:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 06:12:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-09-08 06:12:50,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 17 [2019-09-08 06:12:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:50,581 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-09-08 06:12:50,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:12:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-09-08 06:12:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 06:12:50,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:50,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:50,591 INFO L418 AbstractCegarLoop]: === Iteration 4 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash -556460921, now seen corresponding path program 1 times [2019-09-08 06:12:50,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:12:50,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:12:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:12:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:12:50,691 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 4 states. [2019-09-08 06:12:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:50,716 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2019-09-08 06:12:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:12:50,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-08 06:12:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:50,718 INFO L225 Difference]: With dead ends: 58 [2019-09-08 06:12:50,718 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 06:12:50,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:12:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 06:12:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-08 06:12:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 06:12:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-08 06:12:50,728 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2019-09-08 06:12:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:50,729 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-08 06:12:50,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:12:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-08 06:12:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 06:12:50,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:50,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:50,731 INFO L418 AbstractCegarLoop]: === Iteration 5 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 640539962, now seen corresponding path program 1 times [2019-09-08 06:12:50,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:50,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:50,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:50,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:12:50,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:12:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:12:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:50,824 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 8 states. [2019-09-08 06:12:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:51,025 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-09-08 06:12:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:12:51,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-08 06:12:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:51,027 INFO L225 Difference]: With dead ends: 72 [2019-09-08 06:12:51,028 INFO L226 Difference]: Without dead ends: 68 [2019-09-08 06:12:51,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:12:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-08 06:12:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-09-08 06:12:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:12:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-09-08 06:12:51,041 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 24 [2019-09-08 06:12:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:51,042 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-09-08 06:12:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:12:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-09-08 06:12:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 06:12:51,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:51,044 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:51,044 INFO L418 AbstractCegarLoop]: === Iteration 6 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash 664848972, now seen corresponding path program 1 times [2019-09-08 06:12:51,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:51,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:51,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:51,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:51,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:51,105 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 5 states. [2019-09-08 06:12:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:51,125 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2019-09-08 06:12:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:51,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-08 06:12:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:51,127 INFO L225 Difference]: With dead ends: 67 [2019-09-08 06:12:51,128 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 06:12:51,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 06:12:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 06:12:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 06:12:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2019-09-08 06:12:51,138 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 30 [2019-09-08 06:12:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:51,138 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2019-09-08 06:12:51,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2019-09-08 06:12:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 06:12:51,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:51,140 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:51,141 INFO L418 AbstractCegarLoop]: === Iteration 7 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2018133117, now seen corresponding path program 1 times [2019-09-08 06:12:51,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:51,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:51,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:51,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 06:12:51,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:51,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2019-09-08 06:12:51,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 06:12:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 06:12:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:12:51,599 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 13 states. [2019-09-08 06:12:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:51,832 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2019-09-08 06:12:51,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:12:51,833 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-08 06:12:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:51,835 INFO L225 Difference]: With dead ends: 66 [2019-09-08 06:12:51,835 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 06:12:51,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:12:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 06:12:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-09-08 06:12:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 06:12:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-09-08 06:12:51,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 31 [2019-09-08 06:12:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:51,859 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-09-08 06:12:51,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 06:12:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-09-08 06:12:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 06:12:51,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:51,865 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:51,865 INFO L418 AbstractCegarLoop]: === Iteration 8 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1608830030, now seen corresponding path program 1 times [2019-09-08 06:12:51,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:51,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:12:51,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:12:51,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:12:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:12:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:12:51,988 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2019-09-08 06:12:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:52,170 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2019-09-08 06:12:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:12:52,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-09-08 06:12:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:52,173 INFO L225 Difference]: With dead ends: 73 [2019-09-08 06:12:52,173 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:12:52,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:12:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:12:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2019-09-08 06:12:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 06:12:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-09-08 06:12:52,184 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 32 [2019-09-08 06:12:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:52,185 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-09-08 06:12:52,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:12:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-09-08 06:12:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 06:12:52,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:52,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:52,187 INFO L418 AbstractCegarLoop]: === Iteration 9 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2120605422, now seen corresponding path program 1 times [2019-09-08 06:12:52,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:52,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:12:52,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:52,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:52,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:52,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 06:12:52,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:12:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-08 06:12:52,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 06:12:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 06:12:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:12:52,389 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 13 states. [2019-09-08 06:12:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:52,648 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2019-09-08 06:12:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:12:52,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-08 06:12:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:52,650 INFO L225 Difference]: With dead ends: 85 [2019-09-08 06:12:52,650 INFO L226 Difference]: Without dead ends: 81 [2019-09-08 06:12:52,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:12:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-08 06:12:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2019-09-08 06:12:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 06:12:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-09-08 06:12:52,664 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 32 [2019-09-08 06:12:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:52,664 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-09-08 06:12:52,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 06:12:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-09-08 06:12:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:12:52,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:52,666 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:52,666 INFO L418 AbstractCegarLoop]: === Iteration 10 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1548744425, now seen corresponding path program 1 times [2019-09-08 06:12:52,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:52,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:12:52,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:52,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:52,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 06:12:52,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:12:53,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:53,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2019-09-08 06:12:53,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:12:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:12:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:12:53,030 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 14 states. [2019-09-08 06:12:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:53,294 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-09-08 06:12:53,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:12:53,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-09-08 06:12:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:53,297 INFO L225 Difference]: With dead ends: 79 [2019-09-08 06:12:53,297 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 06:12:53,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:12:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 06:12:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-09-08 06:12:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 06:12:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-09-08 06:12:53,308 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 39 [2019-09-08 06:12:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:53,308 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-09-08 06:12:53,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:12:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-09-08 06:12:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:12:53,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:53,310 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:53,310 INFO L418 AbstractCegarLoop]: === Iteration 11 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -594366391, now seen corresponding path program 1 times [2019-09-08 06:12:53,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:53,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:53,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:12:53,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:53,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:53,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:53,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 06:12:53,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:53,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:53,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2019-09-08 06:12:53,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 06:12:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 06:12:53,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:12:53,682 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 16 states. [2019-09-08 06:12:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:54,034 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-09-08 06:12:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:12:54,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-09-08 06:12:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:54,036 INFO L225 Difference]: With dead ends: 91 [2019-09-08 06:12:54,036 INFO L226 Difference]: Without dead ends: 87 [2019-09-08 06:12:54,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:12:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-08 06:12:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-09-08 06:12:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 06:12:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2019-09-08 06:12:54,049 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 39 [2019-09-08 06:12:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:54,050 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2019-09-08 06:12:54,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 06:12:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2019-09-08 06:12:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:12:54,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:54,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:54,053 INFO L418 AbstractCegarLoop]: === Iteration 12 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1218277146, now seen corresponding path program 1 times [2019-09-08 06:12:54,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:54,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:12:54,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:54,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:54,200 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-09-08 06:12:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:54,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 06:12:54,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:12:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-08 06:12:54,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:12:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:12:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:12:54,299 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 14 states. [2019-09-08 06:12:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:54,532 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2019-09-08 06:12:54,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:12:54,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-09-08 06:12:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:54,535 INFO L225 Difference]: With dead ends: 99 [2019-09-08 06:12:54,535 INFO L226 Difference]: Without dead ends: 95 [2019-09-08 06:12:54,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:12:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-08 06:12:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2019-09-08 06:12:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 06:12:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2019-09-08 06:12:54,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 40 [2019-09-08 06:12:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:54,547 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2019-09-08 06:12:54,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:12:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2019-09-08 06:12:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:12:54,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:54,548 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:54,549 INFO L418 AbstractCegarLoop]: === Iteration 13 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1511184550, now seen corresponding path program 2 times [2019-09-08 06:12:54,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:12:54,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:54,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:12:54,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:54,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:54,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 06:12:54,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:54,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:54,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-08 06:12:54,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:12:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:12:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:12:54,917 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 23 states. [2019-09-08 06:12:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:55,712 INFO L93 Difference]: Finished difference Result 153 states and 206 transitions. [2019-09-08 06:12:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:12:55,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-09-08 06:12:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:55,714 INFO L225 Difference]: With dead ends: 153 [2019-09-08 06:12:55,714 INFO L226 Difference]: Without dead ends: 149 [2019-09-08 06:12:55,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:12:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-08 06:12:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 88. [2019-09-08 06:12:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 06:12:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2019-09-08 06:12:55,730 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 40 [2019-09-08 06:12:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:55,731 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2019-09-08 06:12:55,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:12:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2019-09-08 06:12:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 06:12:55,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:55,733 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:55,733 INFO L418 AbstractCegarLoop]: === Iteration 14 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -93530467, now seen corresponding path program 1 times [2019-09-08 06:12:55,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:55,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:55,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:12:55,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:55,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:55,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:55,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 06:12:55,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:12:56,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:56,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2019-09-08 06:12:56,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 06:12:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 06:12:56,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:12:56,099 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand 17 states. [2019-09-08 06:12:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:56,501 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-09-08 06:12:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:12:56,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-09-08 06:12:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:56,503 INFO L225 Difference]: With dead ends: 111 [2019-09-08 06:12:56,503 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 06:12:56,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:12:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 06:12:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-09-08 06:12:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 06:12:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2019-09-08 06:12:56,517 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 47 [2019-09-08 06:12:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:56,518 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2019-09-08 06:12:56,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 06:12:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2019-09-08 06:12:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 06:12:56,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:56,521 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:56,522 INFO L418 AbstractCegarLoop]: === Iteration 15 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1063987018, now seen corresponding path program 2 times [2019-09-08 06:12:56,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:56,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:56,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:56,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:12:56,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:56,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:56,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:12:56,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:12:57,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:57,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2019-09-08 06:12:57,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:12:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:12:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:12:57,043 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 20 states. [2019-09-08 06:12:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:57,462 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2019-09-08 06:12:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:12:57,463 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2019-09-08 06:12:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:57,465 INFO L225 Difference]: With dead ends: 108 [2019-09-08 06:12:57,466 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 06:12:57,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:12:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 06:12:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-09-08 06:12:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-08 06:12:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2019-09-08 06:12:57,476 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 46 [2019-09-08 06:12:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:57,476 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2019-09-08 06:12:57,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:12:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2019-09-08 06:12:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 06:12:57,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:57,478 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:57,478 INFO L418 AbstractCegarLoop]: === Iteration 16 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1993060398, now seen corresponding path program 3 times [2019-09-08 06:12:57,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:57,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:57,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:57,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 06:12:57,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:57,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:57,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:12:57,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:12:57,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:57,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 06:12:57,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:12:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2019-09-08 06:12:58,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 06:12:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 06:12:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:12:58,021 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand 26 states. [2019-09-08 06:12:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:59,163 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2019-09-08 06:12:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 06:12:59,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-08 06:12:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:59,168 INFO L225 Difference]: With dead ends: 204 [2019-09-08 06:12:59,168 INFO L226 Difference]: Without dead ends: 200 [2019-09-08 06:12:59,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:12:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-08 06:12:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 104. [2019-09-08 06:12:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 06:12:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2019-09-08 06:12:59,185 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 48 [2019-09-08 06:12:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:59,185 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2019-09-08 06:12:59,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 06:12:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2019-09-08 06:12:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 06:12:59,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:59,187 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:59,187 INFO L418 AbstractCegarLoop]: === Iteration 17 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1122508594, now seen corresponding path program 4 times [2019-09-08 06:12:59,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:59,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:12:59,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:59,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:12:59,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:12:59,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:59,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:12:59,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2019-09-08 06:13:00,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:13:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:13:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:13:00,052 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand 34 states. [2019-09-08 06:13:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:01,563 INFO L93 Difference]: Finished difference Result 201 states and 279 transitions. [2019-09-08 06:13:01,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 06:13:01,564 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-09-08 06:13:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:01,565 INFO L225 Difference]: With dead ends: 201 [2019-09-08 06:13:01,565 INFO L226 Difference]: Without dead ends: 197 [2019-09-08 06:13:01,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=2361, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 06:13:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-08 06:13:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2019-09-08 06:13:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 06:13:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2019-09-08 06:13:01,581 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 48 [2019-09-08 06:13:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:01,581 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2019-09-08 06:13:01,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:13:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2019-09-08 06:13:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 06:13:01,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:01,583 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:01,584 INFO L418 AbstractCegarLoop]: === Iteration 18 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -425961158, now seen corresponding path program 5 times [2019-09-08 06:13:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:01,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 06:13:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:01,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:13:02,007 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 06:13:02,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:02,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 06:13:02,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:13:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 34 [2019-09-08 06:13:04,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:13:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:13:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1041, Unknown=1, NotChecked=0, Total=1122 [2019-09-08 06:13:04,749 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand 34 states. [2019-09-08 06:13:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:07,122 INFO L93 Difference]: Finished difference Result 205 states and 295 transitions. [2019-09-08 06:13:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 06:13:07,123 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-09-08 06:13:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:07,125 INFO L225 Difference]: With dead ends: 205 [2019-09-08 06:13:07,125 INFO L226 Difference]: Without dead ends: 201 [2019-09-08 06:13:07,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=388, Invalid=2367, Unknown=1, NotChecked=0, Total=2756 [2019-09-08 06:13:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-08 06:13:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 96. [2019-09-08 06:13:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-08 06:13:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2019-09-08 06:13:07,142 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 56 [2019-09-08 06:13:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:07,142 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2019-09-08 06:13:07,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:13:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2019-09-08 06:13:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 06:13:07,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:07,143 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:07,144 INFO L418 AbstractCegarLoop]: === Iteration 19 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1496754595, now seen corresponding path program 2 times [2019-09-08 06:13:07,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:07,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:07,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:13:07,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:07,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:07,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:13:07,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:13:07,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:07,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 06:13:07,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:13:07,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:07,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-09-08 06:13:07,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 06:13:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 06:13:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:13:07,717 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand 27 states. [2019-09-08 06:13:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:08,665 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2019-09-08 06:13:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:13:08,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-09-08 06:13:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:08,667 INFO L225 Difference]: With dead ends: 141 [2019-09-08 06:13:08,667 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 06:13:08,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:13:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 06:13:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2019-09-08 06:13:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-08 06:13:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2019-09-08 06:13:08,679 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 47 [2019-09-08 06:13:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:08,680 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2019-09-08 06:13:08,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 06:13:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2019-09-08 06:13:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 06:13:08,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:08,681 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:08,681 INFO L418 AbstractCegarLoop]: === Iteration 20 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2072748285, now seen corresponding path program 3 times [2019-09-08 06:13:08,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:08,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:13:08,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:08,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:08,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:13:08,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 06:13:08,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:08,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 06:13:08,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:13:09,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:09,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2019-09-08 06:13:09,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:13:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:13:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:13:09,157 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 23 states. [2019-09-08 06:13:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:09,851 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2019-09-08 06:13:09,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:13:09,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-09-08 06:13:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:09,854 INFO L225 Difference]: With dead ends: 124 [2019-09-08 06:13:09,854 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 06:13:09,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:13:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 06:13:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2019-09-08 06:13:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 06:13:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2019-09-08 06:13:09,865 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 47 [2019-09-08 06:13:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:09,865 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2019-09-08 06:13:09,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:13:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2019-09-08 06:13:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:13:09,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:09,867 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:09,867 INFO L418 AbstractCegarLoop]: === Iteration 21 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -140613079, now seen corresponding path program 3 times [2019-09-08 06:13:09,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:09,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:09,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:13:10,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:10,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:13:10,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:13:10,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:10,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 06:13:10,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:13:10,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:10,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 35 [2019-09-08 06:13:10,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 06:13:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 06:13:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:13:10,888 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand 35 states. [2019-09-08 06:13:11,983 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-09-08 06:13:12,679 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-08 06:13:13,166 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2019-09-08 06:13:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:13,423 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2019-09-08 06:13:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:13:13,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2019-09-08 06:13:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:13,425 INFO L225 Difference]: With dead ends: 144 [2019-09-08 06:13:13,425 INFO L226 Difference]: Without dead ends: 140 [2019-09-08 06:13:13,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=308, Invalid=2142, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 06:13:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-08 06:13:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2019-09-08 06:13:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-08 06:13:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2019-09-08 06:13:13,437 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 55 [2019-09-08 06:13:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:13,438 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2019-09-08 06:13:13,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 06:13:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2019-09-08 06:13:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:13:13,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:13,439 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:13,440 INFO L418 AbstractCegarLoop]: === Iteration 22 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1719334665, now seen corresponding path program 4 times [2019-09-08 06:13:13,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:13,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:13,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:13:13,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:13,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:13,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:13:13,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:13,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:13:13,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:13:14,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:14,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2019-09-08 06:13:14,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 06:13:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 06:13:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-09-08 06:13:14,528 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 29 states. [2019-09-08 06:13:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:15,703 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2019-09-08 06:13:15,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 06:13:15,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-09-08 06:13:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:15,707 INFO L225 Difference]: With dead ends: 164 [2019-09-08 06:13:15,707 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 06:13:15,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:13:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 06:13:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 104. [2019-09-08 06:13:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 06:13:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2019-09-08 06:13:15,722 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 55 [2019-09-08 06:13:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:15,723 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2019-09-08 06:13:15,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 06:13:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2019-09-08 06:13:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:13:15,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:15,724 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:15,724 INFO L418 AbstractCegarLoop]: === Iteration 23 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash -673918359, now seen corresponding path program 5 times [2019-09-08 06:13:15,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:15,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:15,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:13:16,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:16,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:16,300 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 06:13:16,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:16,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:13:16,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 06:13:16,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:16,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 36 [2019-09-08 06:13:16,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 06:13:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 06:13:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 06:13:16,888 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand 36 states. [2019-09-08 06:13:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:18,985 INFO L93 Difference]: Finished difference Result 247 states and 347 transitions. [2019-09-08 06:13:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 06:13:18,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 55 [2019-09-08 06:13:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:18,988 INFO L225 Difference]: With dead ends: 247 [2019-09-08 06:13:18,988 INFO L226 Difference]: Without dead ends: 243 [2019-09-08 06:13:18,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=415, Invalid=2777, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 06:13:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-08 06:13:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 122. [2019-09-08 06:13:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-08 06:13:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2019-09-08 06:13:19,009 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 55 [2019-09-08 06:13:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:19,009 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2019-09-08 06:13:19,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 06:13:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2019-09-08 06:13:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:13:19,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:19,011 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:19,011 INFO L418 AbstractCegarLoop]: === Iteration 24 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1684351081, now seen corresponding path program 6 times [2019-09-08 06:13:19,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:19,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:13:19,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:19,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:19,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:13:19,305 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 06:13:19,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:19,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:13:19,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:13:19,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:19,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2019-09-08 06:13:19,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 06:13:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 06:13:19,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:13:19,564 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand 21 states. [2019-09-08 06:13:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:20,151 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2019-09-08 06:13:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:13:20,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-08 06:13:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:20,153 INFO L225 Difference]: With dead ends: 153 [2019-09-08 06:13:20,153 INFO L226 Difference]: Without dead ends: 149 [2019-09-08 06:13:20,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:13:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-08 06:13:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2019-09-08 06:13:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-08 06:13:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2019-09-08 06:13:20,164 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 55 [2019-09-08 06:13:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:20,165 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2019-09-08 06:13:20,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 06:13:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2019-09-08 06:13:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 06:13:20,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:20,166 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:20,167 INFO L418 AbstractCegarLoop]: === Iteration 25 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:20,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1646820550, now seen corresponding path program 6 times [2019-09-08 06:13:20,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:20,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:20,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:13:20,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:20,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:20,556 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:13:20,578 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 06:13:20,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:20,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 06:13:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:13:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 33 [2019-09-08 06:13:20,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 06:13:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 06:13:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:13:21,000 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand 33 states. [2019-09-08 06:13:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:24,553 INFO L93 Difference]: Finished difference Result 274 states and 397 transitions. [2019-09-08 06:13:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 06:13:24,554 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2019-09-08 06:13:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:24,556 INFO L225 Difference]: With dead ends: 274 [2019-09-08 06:13:24,556 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 06:13:24,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=408, Invalid=2454, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 06:13:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 06:13:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 112. [2019-09-08 06:13:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-08 06:13:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2019-09-08 06:13:24,578 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 56 [2019-09-08 06:13:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:24,578 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2019-09-08 06:13:24,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 06:13:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2019-09-08 06:13:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:13:24,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:24,580 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:24,581 INFO L418 AbstractCegarLoop]: === Iteration 26 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash -399757635, now seen corresponding path program 7 times [2019-09-08 06:13:24,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:24,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:24,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:13:24,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:24,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:24,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 06:13:24,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:25,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:25,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 31 [2019-09-08 06:13:25,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 06:13:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 06:13:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:13:25,389 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand 31 states. [2019-09-08 06:13:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:26,606 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2019-09-08 06:13:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:13:26,607 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 63 [2019-09-08 06:13:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:26,608 INFO L225 Difference]: With dead ends: 174 [2019-09-08 06:13:26,608 INFO L226 Difference]: Without dead ends: 170 [2019-09-08 06:13:26,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:13:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-08 06:13:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2019-09-08 06:13:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-08 06:13:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2019-09-08 06:13:26,621 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 63 [2019-09-08 06:13:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:26,621 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2019-09-08 06:13:26,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 06:13:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2019-09-08 06:13:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:13:26,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:26,623 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:26,623 INFO L418 AbstractCegarLoop]: === Iteration 27 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1013326211, now seen corresponding path program 8 times [2019-09-08 06:13:26,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:26,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:26,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:26,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:26,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:13:26,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:26,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:26,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:13:27,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:13:27,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:27,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 06:13:27,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:13:27,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:27,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 32 [2019-09-08 06:13:27,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 06:13:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 06:13:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:13:27,436 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand 32 states. [2019-09-08 06:13:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:28,743 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2019-09-08 06:13:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:13:28,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2019-09-08 06:13:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:28,745 INFO L225 Difference]: With dead ends: 162 [2019-09-08 06:13:28,745 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 06:13:28,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=317, Invalid=1845, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:13:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 06:13:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 90. [2019-09-08 06:13:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-08 06:13:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2019-09-08 06:13:28,757 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 63 [2019-09-08 06:13:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:28,758 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2019-09-08 06:13:28,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 06:13:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2019-09-08 06:13:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:13:28,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:28,759 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:28,760 INFO L418 AbstractCegarLoop]: === Iteration 28 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2110644797, now seen corresponding path program 9 times [2019-09-08 06:13:28,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:28,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:13:29,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:29,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:29,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:13:29,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:29,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 06:13:29,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:13:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:32,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 44 [2019-09-08 06:13:32,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 06:13:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 06:13:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1788, Unknown=2, NotChecked=0, Total=1892 [2019-09-08 06:13:32,057 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand 44 states. [2019-09-08 06:13:34,374 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 06:13:35,732 WARN L188 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 06:13:36,440 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-09-08 06:13:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:37,087 INFO L93 Difference]: Finished difference Result 174 states and 233 transitions. [2019-09-08 06:13:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:13:37,087 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-09-08 06:13:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:37,089 INFO L225 Difference]: With dead ends: 174 [2019-09-08 06:13:37,089 INFO L226 Difference]: Without dead ends: 170 [2019-09-08 06:13:37,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=517, Invalid=4311, Unknown=2, NotChecked=0, Total=4830 [2019-09-08 06:13:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-08 06:13:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 86. [2019-09-08 06:13:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 06:13:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2019-09-08 06:13:37,101 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 63 [2019-09-08 06:13:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:37,101 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2019-09-08 06:13:37,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 06:13:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2019-09-08 06:13:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:13:37,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:37,102 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:37,103 INFO L418 AbstractCegarLoop]: === Iteration 29 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash 987560566, now seen corresponding path program 10 times [2019-09-08 06:13:37,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:37,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:13:37,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:37,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:37,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:13:37,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:13:37,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:37,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:13:37,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:37,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:13:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 06:13:37,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:37,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2019-09-08 06:13:37,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 06:13:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 06:13:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:13:37,974 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 30 states. [2019-09-08 06:13:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:39,289 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-09-08 06:13:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:13:39,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-09-08 06:13:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:39,291 INFO L225 Difference]: With dead ends: 103 [2019-09-08 06:13:39,291 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 06:13:39,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 06:13:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 06:13:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-09-08 06:13:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-08 06:13:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-09-08 06:13:39,301 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 54 [2019-09-08 06:13:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:39,301 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-09-08 06:13:39,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 06:13:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2019-09-08 06:13:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:13:39,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:39,303 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:39,303 INFO L418 AbstractCegarLoop]: === Iteration 30 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash -853196106, now seen corresponding path program 11 times [2019-09-08 06:13:39,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:39,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:13:39,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:39,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:39,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:13:39,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-09-08 06:13:39,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:39,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 06:13:39,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 06:13:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 23 [2019-09-08 06:13:39,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:13:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:13:39,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:13:39,957 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 23 states. [2019-09-08 06:13:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:40,622 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2019-09-08 06:13:40,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:13:40,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-09-08 06:13:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:40,624 INFO L225 Difference]: With dead ends: 115 [2019-09-08 06:13:40,624 INFO L226 Difference]: Without dead ends: 111 [2019-09-08 06:13:40,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:13:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-08 06:13:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2019-09-08 06:13:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 06:13:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2019-09-08 06:13:40,636 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 54 [2019-09-08 06:13:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:40,637 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2019-09-08 06:13:40,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:13:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2019-09-08 06:13:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:13:40,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:40,639 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:40,639 INFO L418 AbstractCegarLoop]: === Iteration 31 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2111292438, now seen corresponding path program 4 times [2019-09-08 06:13:40,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:40,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:13:40,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:40,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:40,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:13:40,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:13:40,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:40,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 06:13:40,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 06:13:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:41,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 23 [2019-09-08 06:13:41,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:13:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:13:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:13:41,167 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand 23 states. [2019-09-08 06:13:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:41,806 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2019-09-08 06:13:41,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:13:41,807 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-09-08 06:13:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:41,809 INFO L225 Difference]: With dead ends: 125 [2019-09-08 06:13:41,809 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 06:13:41,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:13:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 06:13:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-09-08 06:13:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 06:13:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-09-08 06:13:41,820 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 54 [2019-09-08 06:13:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:41,820 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-09-08 06:13:41,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:13:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-09-08 06:13:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:13:41,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:41,822 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:41,822 INFO L418 AbstractCegarLoop]: === Iteration 32 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash -610857270, now seen corresponding path program 12 times [2019-09-08 06:13:41,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:41,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:41,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:13:42,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:42,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:13:42,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 06:13:42,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:42,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 06:13:42,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:42,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:13:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:13:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2019-09-08 06:13:42,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:13:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:13:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 06:13:42,949 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 37 states. [2019-09-08 06:13:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:46,575 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2019-09-08 06:13:46,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:13:46,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2019-09-08 06:13:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:46,580 INFO L225 Difference]: With dead ends: 170 [2019-09-08 06:13:46,581 INFO L226 Difference]: Without dead ends: 166 [2019-09-08 06:13:46,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 06:13:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-08 06:13:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 110. [2019-09-08 06:13:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 06:13:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2019-09-08 06:13:46,593 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 144 transitions. Word has length 62 [2019-09-08 06:13:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:46,594 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 144 transitions. [2019-09-08 06:13:46,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:13:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2019-09-08 06:13:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:13:46,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:46,595 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:46,595 INFO L418 AbstractCegarLoop]: === Iteration 33 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1349816682, now seen corresponding path program 13 times [2019-09-08 06:13:46,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:46,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:46,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:13:46,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:46,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:47,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 06:13:47,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:13:47,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:47,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 35 [2019-09-08 06:13:47,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 06:13:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 06:13:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:13:47,714 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. Second operand 35 states. [2019-09-08 06:13:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:49,349 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2019-09-08 06:13:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:13:49,350 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 62 [2019-09-08 06:13:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:49,354 INFO L225 Difference]: With dead ends: 162 [2019-09-08 06:13:49,354 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 06:13:49,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=2008, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 06:13:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 06:13:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2019-09-08 06:13:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 06:13:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2019-09-08 06:13:49,376 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 62 [2019-09-08 06:13:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:49,377 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2019-09-08 06:13:49,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 06:13:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2019-09-08 06:13:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:13:49,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:49,379 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:49,380 INFO L418 AbstractCegarLoop]: === Iteration 34 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1146500982, now seen corresponding path program 14 times [2019-09-08 06:13:49,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:49,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:13:49,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:49,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:13:49,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:13:49,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:49,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 06:13:49,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:49,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:49,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 24 [2019-09-08 06:13:49,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 06:13:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 06:13:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-09-08 06:13:49,989 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand 24 states. [2019-09-08 06:13:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:50,649 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2019-09-08 06:13:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:13:50,650 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2019-09-08 06:13:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:50,651 INFO L225 Difference]: With dead ends: 152 [2019-09-08 06:13:50,653 INFO L226 Difference]: Without dead ends: 148 [2019-09-08 06:13:50,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:13:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-08 06:13:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2019-09-08 06:13:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-08 06:13:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2019-09-08 06:13:50,664 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 62 [2019-09-08 06:13:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2019-09-08 06:13:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 06:13:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2019-09-08 06:13:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:13:50,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:50,666 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:50,667 INFO L418 AbstractCegarLoop]: === Iteration 35 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1510236458, now seen corresponding path program 15 times [2019-09-08 06:13:50,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:50,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:13:51,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:51,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:51,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:13:51,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:13:51,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:51,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 06:13:51,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:13:56,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:56,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2019-09-08 06:13:56,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:13:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:13:56,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1245, Unknown=3, NotChecked=0, Total=1332 [2019-09-08 06:13:56,535 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 37 states. [2019-09-08 06:14:03,208 WARN L188 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-09-08 06:14:04,439 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-08 06:14:06,724 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-08 06:14:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:07,344 INFO L93 Difference]: Finished difference Result 204 states and 280 transitions. [2019-09-08 06:14:07,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:14:07,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2019-09-08 06:14:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:07,347 INFO L225 Difference]: With dead ends: 204 [2019-09-08 06:14:07,347 INFO L226 Difference]: Without dead ends: 200 [2019-09-08 06:14:07,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=300, Invalid=2889, Unknown=3, NotChecked=0, Total=3192 [2019-09-08 06:14:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-08 06:14:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 142. [2019-09-08 06:14:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-08 06:14:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 194 transitions. [2019-09-08 06:14:07,362 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 194 transitions. Word has length 62 [2019-09-08 06:14:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:07,362 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 194 transitions. [2019-09-08 06:14:07,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:14:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 194 transitions. [2019-09-08 06:14:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:14:07,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:07,364 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:07,364 INFO L418 AbstractCegarLoop]: === Iteration 36 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:07,365 INFO L82 PathProgramCache]: Analyzing trace with hash 814172970, now seen corresponding path program 16 times [2019-09-08 06:14:07,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:07,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:07,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:07,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:07,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:14:07,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:07,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:07,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:14:07,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:14:07,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:07,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 06:14:07,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:14:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:07,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 24 [2019-09-08 06:14:07,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 06:14:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 06:14:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-09-08 06:14:07,972 INFO L87 Difference]: Start difference. First operand 142 states and 194 transitions. Second operand 24 states. [2019-09-08 06:14:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:08,645 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-09-08 06:14:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:14:08,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2019-09-08 06:14:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:08,647 INFO L225 Difference]: With dead ends: 172 [2019-09-08 06:14:08,648 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 06:14:08,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:14:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 06:14:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2019-09-08 06:14:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-08 06:14:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-09-08 06:14:08,660 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 62 [2019-09-08 06:14:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:08,660 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-09-08 06:14:08,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 06:14:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-09-08 06:14:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:14:08,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:08,662 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:08,662 INFO L418 AbstractCegarLoop]: === Iteration 37 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:08,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -824056886, now seen corresponding path program 5 times [2019-09-08 06:14:08,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:08,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:14:08,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:08,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:14:09,013 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 06:14:09,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:09,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 06:14:09,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:14:09,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:09,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2019-09-08 06:14:09,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 06:14:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 06:14:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:14:09,744 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 33 states. [2019-09-08 06:14:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:10,928 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2019-09-08 06:14:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:14:10,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-09-08 06:14:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:10,931 INFO L225 Difference]: With dead ends: 172 [2019-09-08 06:14:10,931 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 06:14:10,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=1602, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:14:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 06:14:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 143. [2019-09-08 06:14:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 06:14:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-08 06:14:10,943 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 62 [2019-09-08 06:14:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:10,944 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-08 06:14:10,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 06:14:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-08 06:14:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 06:14:10,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:10,946 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:10,946 INFO L418 AbstractCegarLoop]: === Iteration 38 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -831765258, now seen corresponding path program 17 times [2019-09-08 06:14:10,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:10,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:14:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:11,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:14:11,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 06:14:11,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:11,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 06:14:11,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 06:14:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:11,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 29 [2019-09-08 06:14:11,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 06:14:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 06:14:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2019-09-08 06:14:11,803 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 29 states. [2019-09-08 06:14:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:12,649 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2019-09-08 06:14:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:14:12,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2019-09-08 06:14:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:12,652 INFO L225 Difference]: With dead ends: 211 [2019-09-08 06:14:12,652 INFO L226 Difference]: Without dead ends: 207 [2019-09-08 06:14:12,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:14:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-08 06:14:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 139. [2019-09-08 06:14:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 06:14:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 189 transitions. [2019-09-08 06:14:12,667 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 189 transitions. Word has length 70 [2019-09-08 06:14:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:12,667 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 189 transitions. [2019-09-08 06:14:12,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 06:14:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2019-09-08 06:14:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 06:14:12,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:12,669 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:12,670 INFO L418 AbstractCegarLoop]: === Iteration 39 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1949286826, now seen corresponding path program 18 times [2019-09-08 06:14:12,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:12,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:12,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 06:14:13,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:13,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:14:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:13,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 06:14:13,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:13,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 06:14:13,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:14:14,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:14,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 40 [2019-09-08 06:14:14,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 06:14:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 06:14:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:14:14,664 INFO L87 Difference]: Start difference. First operand 139 states and 189 transitions. Second operand 40 states. [2019-09-08 06:14:16,518 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-09-08 06:14:18,134 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-09-08 06:14:18,482 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-08 06:14:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:19,314 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2019-09-08 06:14:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 06:14:19,317 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 70 [2019-09-08 06:14:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:19,319 INFO L225 Difference]: With dead ends: 228 [2019-09-08 06:14:19,319 INFO L226 Difference]: Without dead ends: 224 [2019-09-08 06:14:19,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=346, Invalid=3560, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 06:14:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-08 06:14:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2019-09-08 06:14:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-08 06:14:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-09-08 06:14:19,335 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 70 [2019-09-08 06:14:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:19,336 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-09-08 06:14:19,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 06:14:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-09-08 06:14:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 06:14:19,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:19,337 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:19,338 INFO L418 AbstractCegarLoop]: === Iteration 40 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash -234513706, now seen corresponding path program 19 times [2019-09-08 06:14:19,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:19,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:14:19,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:19,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:19,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:14:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:19,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 06:14:19,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 06:14:23,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 45 [2019-09-08 06:14:23,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 06:14:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 06:14:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1864, Unknown=1, NotChecked=0, Total=1980 [2019-09-08 06:14:23,311 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 45 states. [2019-09-08 06:14:28,622 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-09-08 06:14:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:29,354 INFO L93 Difference]: Finished difference Result 259 states and 371 transitions. [2019-09-08 06:14:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 06:14:29,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 70 [2019-09-08 06:14:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:29,357 INFO L225 Difference]: With dead ends: 259 [2019-09-08 06:14:29,358 INFO L226 Difference]: Without dead ends: 255 [2019-09-08 06:14:29,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=383, Invalid=3276, Unknown=1, NotChecked=0, Total=3660 [2019-09-08 06:14:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-08 06:14:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 163. [2019-09-08 06:14:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 06:14:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2019-09-08 06:14:29,374 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 70 [2019-09-08 06:14:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:29,375 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2019-09-08 06:14:29,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 06:14:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2019-09-08 06:14:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 06:14:29,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:29,376 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:29,377 INFO L418 AbstractCegarLoop]: === Iteration 41 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1112626838, now seen corresponding path program 20 times [2019-09-08 06:14:29,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:29,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:29,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:14:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:14:29,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:29,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:29,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:14:29,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:14:29,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:29,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 06:14:29,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 06:14:30,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:30,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 40 [2019-09-08 06:14:30,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 06:14:30,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 06:14:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1451, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:14:30,617 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand 40 states. [2019-09-08 06:14:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:32,013 INFO L93 Difference]: Finished difference Result 238 states and 340 transitions. [2019-09-08 06:14:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 06:14:32,013 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 70 [2019-09-08 06:14:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:32,015 INFO L225 Difference]: With dead ends: 238 [2019-09-08 06:14:32,015 INFO L226 Difference]: Without dead ends: 234 [2019-09-08 06:14:32,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=348, Invalid=2732, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 06:14:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-08 06:14:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 141. [2019-09-08 06:14:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-08 06:14:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2019-09-08 06:14:32,030 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 70 [2019-09-08 06:14:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:32,030 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2019-09-08 06:14:32,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 06:14:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2019-09-08 06:14:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 06:14:32,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:32,032 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:32,033 INFO L418 AbstractCegarLoop]: === Iteration 42 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -4894730, now seen corresponding path program 21 times [2019-09-08 06:14:32,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:32,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:32,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 54 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:14:32,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:32,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:14:32,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:14:32,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:32,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 06:14:32,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 06:14:34,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 37 [2019-09-08 06:14:34,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:14:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:14:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 06:14:34,430 INFO L87 Difference]: Start difference. First operand 141 states and 191 transitions. Second operand 37 states. [2019-09-08 06:14:35,740 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 06:14:36,073 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 06:14:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:36,394 INFO L93 Difference]: Finished difference Result 189 states and 255 transitions. [2019-09-08 06:14:36,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:14:36,394 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-08 06:14:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:36,396 INFO L225 Difference]: With dead ends: 189 [2019-09-08 06:14:36,396 INFO L226 Difference]: Without dead ends: 185 [2019-09-08 06:14:36,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 06:14:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-08 06:14:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 143. [2019-09-08 06:14:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 06:14:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-08 06:14:36,408 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 70 [2019-09-08 06:14:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:36,408 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-08 06:14:36,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:14:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-08 06:14:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:14:36,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:36,410 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:36,410 INFO L418 AbstractCegarLoop]: === Iteration 43 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1455278358, now seen corresponding path program 22 times [2019-09-08 06:14:36,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:36,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 06:14:37,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:37,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:37,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:14:37,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:14:37,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:37,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 06:14:37,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 06:14:38,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 51 [2019-09-08 06:14:38,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 06:14:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 06:14:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2411, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 06:14:38,473 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 51 states. [2019-09-08 06:14:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:14:41,846 INFO L93 Difference]: Finished difference Result 280 states and 397 transitions. [2019-09-08 06:14:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 06:14:41,846 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 78 [2019-09-08 06:14:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:14:41,848 INFO L225 Difference]: With dead ends: 280 [2019-09-08 06:14:41,848 INFO L226 Difference]: Without dead ends: 276 [2019-09-08 06:14:41,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=702, Invalid=5304, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 06:14:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-08 06:14:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 149. [2019-09-08 06:14:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-08 06:14:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-09-08 06:14:41,865 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 78 [2019-09-08 06:14:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:14:41,866 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-09-08 06:14:41,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 06:14:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-09-08 06:14:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 06:14:41,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:14:41,867 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:14:41,868 INFO L418 AbstractCegarLoop]: === Iteration 44 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:14:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:14:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1653300105, now seen corresponding path program 23 times [2019-09-08 06:14:41,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:14:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:14:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:41,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:14:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:14:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:14:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:14:42,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:14:42,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:14:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:14:42,221 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 06:14:42,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:14:42,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 06:14:42,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 06:14:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2019-09-08 06:14:43,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:14:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:14:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 06:14:43,004 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 37 states. [2019-09-08 06:15:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:15:09,278 INFO L93 Difference]: Finished difference Result 232 states and 326 transitions. [2019-09-08 06:15:09,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 06:15:09,279 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-09-08 06:15:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:15:09,281 INFO L225 Difference]: With dead ends: 232 [2019-09-08 06:15:09,281 INFO L226 Difference]: Without dead ends: 228 [2019-09-08 06:15:09,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=332, Invalid=2636, Unknown=2, NotChecked=0, Total=2970 [2019-09-08 06:15:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-08 06:15:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2019-09-08 06:15:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-08 06:15:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2019-09-08 06:15:09,294 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 71 [2019-09-08 06:15:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:15:09,294 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2019-09-08 06:15:09,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:15:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2019-09-08 06:15:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:15:09,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:15:09,295 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:15:09,296 INFO L418 AbstractCegarLoop]: === Iteration 45 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:15:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:15:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1052639050, now seen corresponding path program 24 times [2019-09-08 06:15:09,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:15:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:15:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:09,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:15:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:15:09,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:15:09,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:15:09,947 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:15:09,990 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-08 06:15:09,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:15:09,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 06:15:09,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:15:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 06:15:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:15:11,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 46 [2019-09-08 06:15:11,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 06:15:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 06:15:11,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:15:11,583 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand 46 states. [2019-09-08 06:15:27,843 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 06:15:28,301 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 06:15:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:15:31,647 INFO L93 Difference]: Finished difference Result 234 states and 329 transitions. [2019-09-08 06:15:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:15:31,647 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 78 [2019-09-08 06:15:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:15:31,650 INFO L225 Difference]: With dead ends: 234 [2019-09-08 06:15:31,650 INFO L226 Difference]: Without dead ends: 230 [2019-09-08 06:15:31,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=470, Invalid=3690, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 06:15:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-08 06:15:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 115. [2019-09-08 06:15:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 06:15:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2019-09-08 06:15:31,666 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 78 [2019-09-08 06:15:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:15:31,667 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2019-09-08 06:15:31,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 06:15:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2019-09-08 06:15:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:15:31,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:15:31,669 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:15:31,669 INFO L418 AbstractCegarLoop]: === Iteration 46 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:15:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:15:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1045078422, now seen corresponding path program 25 times [2019-09-08 06:15:31,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:15:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:15:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:31,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:15:31,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 06:15:32,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:15:32,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:15:32,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:15:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:32,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:15:32,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:15:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 06:15:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:15:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 47 [2019-09-08 06:15:35,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 06:15:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 06:15:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2041, Unknown=1, NotChecked=0, Total=2162 [2019-09-08 06:15:35,806 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand 47 states. [2019-09-08 06:15:48,420 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-09-08 06:15:49,247 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-09-08 06:15:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:15:57,437 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2019-09-08 06:15:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:15:57,438 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 78 [2019-09-08 06:15:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:15:57,441 INFO L225 Difference]: With dead ends: 207 [2019-09-08 06:15:57,441 INFO L226 Difference]: Without dead ends: 203 [2019-09-08 06:15:57,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=443, Invalid=3716, Unknown=1, NotChecked=0, Total=4160 [2019-09-08 06:15:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-08 06:15:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-09-08 06:15:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 06:15:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2019-09-08 06:15:57,455 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 78 [2019-09-08 06:15:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:15:57,456 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2019-09-08 06:15:57,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 06:15:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2019-09-08 06:15:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:15:57,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:15:57,458 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:15:57,458 INFO L418 AbstractCegarLoop]: === Iteration 47 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:15:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:15:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1456367882, now seen corresponding path program 26 times [2019-09-08 06:15:57,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:15:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:15:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:15:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 06:15:58,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:15:58,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:15:58,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:15:58,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:15:58,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:15:58,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 06:15:58,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:15:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 06:15:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:15:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 45 [2019-09-08 06:15:59,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 06:15:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 06:15:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1848, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:15:59,272 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand 45 states. [2019-09-08 06:16:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:02,091 INFO L93 Difference]: Finished difference Result 273 states and 387 transitions. [2019-09-08 06:16:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 06:16:02,092 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2019-09-08 06:16:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:02,094 INFO L225 Difference]: With dead ends: 273 [2019-09-08 06:16:02,094 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 06:16:02,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=530, Invalid=3892, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 06:16:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 06:16:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 114. [2019-09-08 06:16:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 06:16:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2019-09-08 06:16:02,117 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 78 [2019-09-08 06:16:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:02,117 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2019-09-08 06:16:02,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 06:16:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2019-09-08 06:16:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 06:16:02,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:02,119 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:02,120 INFO L418 AbstractCegarLoop]: === Iteration 48 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 384430593, now seen corresponding path program 27 times [2019-09-08 06:16:02,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:02,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:02,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:16:02,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:02,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:16:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:02,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:16:02,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:02,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 06:16:02,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:16:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:16:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2019-09-08 06:16:06,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 06:16:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 06:16:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1178, Unknown=1, NotChecked=0, Total=1260 [2019-09-08 06:16:06,235 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand 36 states. [2019-09-08 06:16:07,670 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-08 06:16:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:19,386 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2019-09-08 06:16:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:16:19,387 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 61 [2019-09-08 06:16:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:19,388 INFO L225 Difference]: With dead ends: 132 [2019-09-08 06:16:19,388 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 06:16:19,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=245, Invalid=2104, Unknown=3, NotChecked=0, Total=2352 [2019-09-08 06:16:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 06:16:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-09-08 06:16:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 06:16:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2019-09-08 06:16:19,399 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 61 [2019-09-08 06:16:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:19,399 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2019-09-08 06:16:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 06:16:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2019-09-08 06:16:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 06:16:19,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:19,401 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:19,401 INFO L418 AbstractCegarLoop]: === Iteration 49 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash 101000353, now seen corresponding path program 6 times [2019-09-08 06:16:19,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:19,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 06:16:19,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:19,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:16:19,866 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 06:16:19,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:19,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 06:16:19,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:16:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:16:22,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:22,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2019-09-08 06:16:22,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 06:16:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 06:16:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1178, Unknown=1, NotChecked=0, Total=1260 [2019-09-08 06:16:22,235 INFO L87 Difference]: Start difference. First operand 117 states and 153 transitions. Second operand 36 states. [2019-09-08 06:16:25,451 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-09-08 06:16:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:32,156 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2019-09-08 06:16:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:16:32,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 61 [2019-09-08 06:16:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:32,158 INFO L225 Difference]: With dead ends: 137 [2019-09-08 06:16:32,158 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 06:16:32,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=249, Invalid=2198, Unknown=3, NotChecked=0, Total=2450 [2019-09-08 06:16:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 06:16:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2019-09-08 06:16:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 06:16:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2019-09-08 06:16:32,168 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 61 [2019-09-08 06:16:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:32,169 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2019-09-08 06:16:32,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 06:16:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2019-09-08 06:16:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 06:16:32,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:32,170 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:32,170 INFO L418 AbstractCegarLoop]: === Iteration 50 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -193393962, now seen corresponding path program 28 times [2019-09-08 06:16:32,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:32,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 06:16:32,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:32,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:33,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:16:33,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:16:33,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:33,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:16:33,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 06:16:34,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:34,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25] total 53 [2019-09-08 06:16:34,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 06:16:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 06:16:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2612, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 06:16:34,630 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand 53 states. [2019-09-08 06:16:40,888 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 06:16:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:41,370 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2019-09-08 06:16:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 06:16:41,371 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 86 [2019-09-08 06:16:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:41,373 INFO L225 Difference]: With dead ends: 261 [2019-09-08 06:16:41,373 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 06:16:41,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=845, Invalid=6127, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 06:16:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 06:16:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 118. [2019-09-08 06:16:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 06:16:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2019-09-08 06:16:41,384 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 86 [2019-09-08 06:16:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:41,385 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2019-09-08 06:16:41,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 06:16:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2019-09-08 06:16:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 06:16:41,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:41,386 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:41,386 INFO L418 AbstractCegarLoop]: === Iteration 51 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1584104394, now seen corresponding path program 29 times [2019-09-08 06:16:41,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:41,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 111 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 06:16:42,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:42,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:42,294 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:16:42,325 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 06:16:42,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:42,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:16:42,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 61 proven. 35 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 06:16:43,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:43,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 24] total 53 [2019-09-08 06:16:43,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 06:16:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 06:16:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 06:16:43,722 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand 53 states. [2019-09-08 06:16:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:46,715 INFO L93 Difference]: Finished difference Result 231 states and 318 transitions. [2019-09-08 06:16:46,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:16:46,716 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 86 [2019-09-08 06:16:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:46,717 INFO L225 Difference]: With dead ends: 231 [2019-09-08 06:16:46,717 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 06:16:46,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=593, Invalid=4663, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 06:16:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 06:16:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 104. [2019-09-08 06:16:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 06:16:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-09-08 06:16:46,728 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 86 [2019-09-08 06:16:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:46,728 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-09-08 06:16:46,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 06:16:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-09-08 06:16:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:16:46,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:46,730 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:46,730 INFO L418 AbstractCegarLoop]: === Iteration 52 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1531828371, now seen corresponding path program 30 times [2019-09-08 06:16:46,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:46,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:46,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:16:47,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:47,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:47,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:16:47,140 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 06:16:47,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:47,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 06:16:47,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 06:16:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:47,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 30 [2019-09-08 06:16:47,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 06:16:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 06:16:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:16:47,684 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 30 states. [2019-09-08 06:16:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:48,675 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2019-09-08 06:16:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:16:48,675 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2019-09-08 06:16:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:48,677 INFO L225 Difference]: With dead ends: 131 [2019-09-08 06:16:48,677 INFO L226 Difference]: Without dead ends: 127 [2019-09-08 06:16:48,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 06:16:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-08 06:16:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-08 06:16:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 06:16:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2019-09-08 06:16:48,691 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 69 [2019-09-08 06:16:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:48,691 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2019-09-08 06:16:48,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 06:16:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2019-09-08 06:16:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:16:48,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:48,693 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:48,693 INFO L418 AbstractCegarLoop]: === Iteration 53 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1296404275, now seen corresponding path program 31 times [2019-09-08 06:16:48,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:48,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:16:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:49,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:16:49,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:49,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 06:16:49,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 06:16:49,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:49,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 34 [2019-09-08 06:16:49,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:16:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:16:49,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:16:49,949 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand 34 states. [2019-09-08 06:16:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:51,261 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2019-09-08 06:16:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:16:51,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2019-09-08 06:16:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:51,263 INFO L225 Difference]: With dead ends: 168 [2019-09-08 06:16:51,263 INFO L226 Difference]: Without dead ends: 164 [2019-09-08 06:16:51,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:16:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-08 06:16:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2019-09-08 06:16:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-08 06:16:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2019-09-08 06:16:51,272 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 69 [2019-09-08 06:16:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:51,273 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2019-09-08 06:16:51,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:16:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2019-09-08 06:16:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:16:51,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:51,274 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:51,274 INFO L418 AbstractCegarLoop]: === Iteration 54 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1770690291, now seen corresponding path program 32 times [2019-09-08 06:16:51,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:51,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:51,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:51,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:16:51,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:16:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:16:51,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:16:51,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:16:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:16:51,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:16:51,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:16:51,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 06:16:51,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:16:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 06:16:56,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:16:56,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 37 [2019-09-08 06:16:56,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:16:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:16:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1240, Unknown=4, NotChecked=0, Total=1332 [2019-09-08 06:16:56,538 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand 37 states. [2019-09-08 06:16:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:16:59,946 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2019-09-08 06:16:59,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:16:59,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2019-09-08 06:16:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:16:59,948 INFO L225 Difference]: With dead ends: 171 [2019-09-08 06:16:59,949 INFO L226 Difference]: Without dead ends: 167 [2019-09-08 06:16:59,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=240, Invalid=2206, Unknown=4, NotChecked=0, Total=2450 [2019-09-08 06:16:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-08 06:16:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2019-09-08 06:16:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-08 06:16:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2019-09-08 06:16:59,962 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 69 [2019-09-08 06:16:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:16:59,962 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2019-09-08 06:16:59,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:16:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2019-09-08 06:16:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:16:59,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:16:59,964 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:16:59,964 INFO L418 AbstractCegarLoop]: === Iteration 55 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:16:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:16:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1901136467, now seen corresponding path program 33 times [2019-09-08 06:16:59,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:16:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:16:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:59,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:16:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:16:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:17:00,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:00,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:17:00,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:17:00,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:00,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 06:17:00,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:05,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:17:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:17:05,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:05,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2019-09-08 06:17:05,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 06:17:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 06:17:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1319, Unknown=2, NotChecked=0, Total=1406 [2019-09-08 06:17:05,478 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand 38 states. [2019-09-08 06:17:07,052 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-08 06:17:09,340 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-08 06:17:12,451 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2019-09-08 06:17:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:12,578 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2019-09-08 06:17:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:17:12,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2019-09-08 06:17:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:12,581 INFO L225 Difference]: With dead ends: 150 [2019-09-08 06:17:12,581 INFO L226 Difference]: Without dead ends: 141 [2019-09-08 06:17:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=259, Invalid=2391, Unknown=2, NotChecked=0, Total=2652 [2019-09-08 06:17:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-08 06:17:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2019-09-08 06:17:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 06:17:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2019-09-08 06:17:12,591 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 69 [2019-09-08 06:17:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:12,591 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2019-09-08 06:17:12,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 06:17:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2019-09-08 06:17:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:17:12,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:12,592 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:12,592 INFO L418 AbstractCegarLoop]: === Iteration 56 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1665712371, now seen corresponding path program 34 times [2019-09-08 06:17:12,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:12,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:17:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:17:13,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:13,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:13,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:17:13,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:17:13,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:13,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 06:17:13,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:17:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:17:14,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:14,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2019-09-08 06:17:14,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 06:17:14,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 06:17:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1319, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 06:17:14,474 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 38 states. [2019-09-08 06:17:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:22,856 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2019-09-08 06:17:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:17:22,858 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2019-09-08 06:17:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:22,859 INFO L225 Difference]: With dead ends: 156 [2019-09-08 06:17:22,860 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 06:17:22,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=261, Invalid=2390, Unknown=1, NotChecked=0, Total=2652 [2019-09-08 06:17:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 06:17:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2019-09-08 06:17:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 06:17:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2019-09-08 06:17:22,886 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 69 [2019-09-08 06:17:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:22,887 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2019-09-08 06:17:22,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 06:17:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2019-09-08 06:17:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 06:17:22,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:22,888 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:22,888 INFO L418 AbstractCegarLoop]: === Iteration 57 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1535266195, now seen corresponding path program 7 times [2019-09-08 06:17:22,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:22,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:17:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:17:23,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:23,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:23,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:23,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 06:17:23,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 06:17:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:23,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 30 [2019-09-08 06:17:23,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 06:17:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 06:17:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:17:23,939 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 30 states. [2019-09-08 06:17:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:24,970 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2019-09-08 06:17:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:17:24,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2019-09-08 06:17:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:24,972 INFO L225 Difference]: With dead ends: 162 [2019-09-08 06:17:24,973 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 06:17:24,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 06:17:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 06:17:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2019-09-08 06:17:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-08 06:17:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2019-09-08 06:17:24,982 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 69 [2019-09-08 06:17:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:24,982 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2019-09-08 06:17:24,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 06:17:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2019-09-08 06:17:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:17:24,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:24,984 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:24,984 INFO L418 AbstractCegarLoop]: === Iteration 58 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:24,985 INFO L82 PathProgramCache]: Analyzing trace with hash 577234881, now seen corresponding path program 35 times [2019-09-08 06:17:24,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:24,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:24,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:17:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:25,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:25,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:17:25,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 06:17:25,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:25,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:17:25,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 06:17:26,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:26,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 31 [2019-09-08 06:17:26,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 06:17:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 06:17:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:17:26,031 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand 31 states. [2019-09-08 06:17:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:27,016 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2019-09-08 06:17:27,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:17:27,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 77 [2019-09-08 06:17:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:27,018 INFO L225 Difference]: With dead ends: 164 [2019-09-08 06:17:27,019 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 06:17:27,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:17:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 06:17:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-09-08 06:17:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 06:17:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2019-09-08 06:17:27,028 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 77 [2019-09-08 06:17:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:27,029 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2019-09-08 06:17:27,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 06:17:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2019-09-08 06:17:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:17:27,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:27,030 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:27,030 INFO L418 AbstractCegarLoop]: === Iteration 59 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash -395682943, now seen corresponding path program 36 times [2019-09-08 06:17:27,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:27,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:27,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:17:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:17:27,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:27,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:17:27,560 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 06:17:27,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:27,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 06:17:27,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:30,535 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:17:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 06:17:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 43 [2019-09-08 06:17:30,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 06:17:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 06:17:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1692, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:17:30,555 INFO L87 Difference]: Start difference. First operand 143 states and 190 transitions. Second operand 43 states. [2019-09-08 06:17:35,128 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-08 06:17:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:35,253 INFO L93 Difference]: Finished difference Result 201 states and 272 transitions. [2019-09-08 06:17:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 06:17:35,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 77 [2019-09-08 06:17:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:35,255 INFO L225 Difference]: With dead ends: 201 [2019-09-08 06:17:35,255 INFO L226 Difference]: Without dead ends: 197 [2019-09-08 06:17:35,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=304, Invalid=3356, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 06:17:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-08 06:17:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2019-09-08 06:17:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-08 06:17:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 195 transitions. [2019-09-08 06:17:35,266 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 195 transitions. Word has length 77 [2019-09-08 06:17:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:35,267 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 195 transitions. [2019-09-08 06:17:35,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 06:17:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 195 transitions. [2019-09-08 06:17:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:17:35,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:35,268 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:35,268 INFO L418 AbstractCegarLoop]: === Iteration 60 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1219056607, now seen corresponding path program 37 times [2019-09-08 06:17:35,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:35,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:17:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:17:35,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:35,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:35,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:17:35,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 06:17:37,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:37,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 41 [2019-09-08 06:17:37,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 06:17:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 06:17:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1536, Unknown=1, NotChecked=0, Total=1640 [2019-09-08 06:17:37,104 INFO L87 Difference]: Start difference. First operand 146 states and 195 transitions. Second operand 41 states. [2019-09-08 06:17:52,888 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-08 06:17:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:56,500 INFO L93 Difference]: Finished difference Result 320 states and 442 transitions. [2019-09-08 06:17:56,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 06:17:56,501 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-09-08 06:17:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:56,502 INFO L225 Difference]: With dead ends: 320 [2019-09-08 06:17:56,503 INFO L226 Difference]: Without dead ends: 316 [2019-09-08 06:17:56,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=444, Invalid=3977, Unknown=1, NotChecked=0, Total=4422 [2019-09-08 06:17:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-08 06:17:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2019-09-08 06:17:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-08 06:17:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2019-09-08 06:17:56,517 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 77 [2019-09-08 06:17:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:56,517 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2019-09-08 06:17:56,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 06:17:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2019-09-08 06:17:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:17:56,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:56,532 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:56,532 INFO L418 AbstractCegarLoop]: === Iteration 61 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash 414884449, now seen corresponding path program 38 times [2019-09-08 06:17:56,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:56,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:56,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 06:17:57,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:57,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:57,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:17:57,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:17:57,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:57,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:17:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:18:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 06:18:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:18:51,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 38 [2019-09-08 06:18:51,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 06:18:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 06:18:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1286, Unknown=23, NotChecked=0, Total=1406 [2019-09-08 06:18:51,530 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand 38 states. [2019-09-08 06:20:09,943 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-08 06:20:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:20:24,336 INFO L93 Difference]: Finished difference Result 307 states and 433 transitions. [2019-09-08 06:20:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:20:24,399 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 77 [2019-09-08 06:20:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:20:24,401 INFO L225 Difference]: With dead ends: 307 [2019-09-08 06:20:24,401 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 06:20:24,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=297, Invalid=3220, Unknown=23, NotChecked=0, Total=3540 [2019-09-08 06:20:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 06:20:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 213. [2019-09-08 06:20:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 06:20:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 305 transitions. [2019-09-08 06:20:24,415 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 305 transitions. Word has length 77 [2019-09-08 06:20:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:20:24,415 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 305 transitions. [2019-09-08 06:20:24,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 06:20:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 305 transitions. [2019-09-08 06:20:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:20:24,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:20:24,417 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:20:24,418 INFO L418 AbstractCegarLoop]: === Iteration 62 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:20:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:20:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 429667809, now seen corresponding path program 39 times [2019-09-08 06:20:24,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:20:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:20:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:24,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:20:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:20:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:20:25,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:20:25,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:20:25,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:20:25,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:20:25,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:20:25,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 06:20:25,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:20:28,355 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:20:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 06:20:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:20:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21] total 47 [2019-09-08 06:20:28,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 06:20:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 06:20:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2042, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:20:28,384 INFO L87 Difference]: Start difference. First operand 213 states and 305 transitions. Second operand 47 states. [2019-09-08 06:20:31,877 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-09-08 06:20:32,566 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-09-08 06:20:33,422 WARN L188 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 06:20:36,182 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-08 06:20:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:20:37,632 INFO L93 Difference]: Finished difference Result 370 states and 540 transitions. [2019-09-08 06:20:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 06:20:37,632 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 77 [2019-09-08 06:20:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:20:37,635 INFO L225 Difference]: With dead ends: 370 [2019-09-08 06:20:37,635 INFO L226 Difference]: Without dead ends: 366 [2019-09-08 06:20:37,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=418, Invalid=4552, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 06:20:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-08 06:20:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 247. [2019-09-08 06:20:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 06:20:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 361 transitions. [2019-09-08 06:20:37,655 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 361 transitions. Word has length 77 [2019-09-08 06:20:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:20:37,655 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 361 transitions. [2019-09-08 06:20:37,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 06:20:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 361 transitions. [2019-09-08 06:20:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:20:37,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:20:37,657 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:20:37,657 INFO L418 AbstractCegarLoop]: === Iteration 63 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:20:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:20:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1402585633, now seen corresponding path program 40 times [2019-09-08 06:20:37,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:20:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:20:37,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:37,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:20:37,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:20:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:20:38,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:20:38,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:20:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:20:38,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:20:38,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:20:38,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 06:20:38,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:20:39,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:20:42,213 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:20:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 06:20:42,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:20:42,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 43 [2019-09-08 06:20:42,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 06:20:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 06:20:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1695, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:20:42,230 INFO L87 Difference]: Start difference. First operand 247 states and 361 transitions. Second operand 43 states. [2019-09-08 06:20:43,272 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 06:20:44,095 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 06:20:44,723 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-08 06:20:47,324 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 06:20:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:20:49,387 INFO L93 Difference]: Finished difference Result 277 states and 400 transitions. [2019-09-08 06:20:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:20:49,388 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 77 [2019-09-08 06:20:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:20:49,390 INFO L225 Difference]: With dead ends: 277 [2019-09-08 06:20:49,390 INFO L226 Difference]: Without dead ends: 273 [2019-09-08 06:20:49,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=279, Invalid=3143, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 06:20:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-08 06:20:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2019-09-08 06:20:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 06:20:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 361 transitions. [2019-09-08 06:20:49,414 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 361 transitions. Word has length 77 [2019-09-08 06:20:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:20:49,415 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 361 transitions. [2019-09-08 06:20:49,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 06:20:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 361 transitions. [2019-09-08 06:20:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:20:49,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:20:49,416 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:20:49,418 INFO L418 AbstractCegarLoop]: === Iteration 64 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:20:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:20:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash -556056287, now seen corresponding path program 8 times [2019-09-08 06:20:49,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:20:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:20:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:49,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:20:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:20:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:20:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:20:49,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:20:49,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:20:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:20:50,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:20:50,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:20:50,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:20:50,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:20:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 06:20:52,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:20:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 37 [2019-09-08 06:20:52,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:20:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:20:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1240, Unknown=1, NotChecked=0, Total=1332 [2019-09-08 06:20:52,778 INFO L87 Difference]: Start difference. First operand 247 states and 361 transitions. Second operand 37 states. [2019-09-08 06:21:01,733 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-08 06:21:02,696 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-08 06:21:06,107 WARN L188 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-09-08 06:21:06,965 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-09-08 06:21:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:07,326 INFO L93 Difference]: Finished difference Result 294 states and 429 transitions. [2019-09-08 06:21:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:21:07,327 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 77 [2019-09-08 06:21:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:07,329 INFO L225 Difference]: With dead ends: 294 [2019-09-08 06:21:07,329 INFO L226 Difference]: Without dead ends: 290 [2019-09-08 06:21:07,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=313, Invalid=2337, Unknown=2, NotChecked=0, Total=2652 [2019-09-08 06:21:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-08 06:21:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 244. [2019-09-08 06:21:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-08 06:21:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions. [2019-09-08 06:21:07,344 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 77 [2019-09-08 06:21:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:07,344 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 356 transitions. [2019-09-08 06:21:07,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:21:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions. [2019-09-08 06:21:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:21:07,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:07,346 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:07,347 INFO L418 AbstractCegarLoop]: === Iteration 65 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1240235201, now seen corresponding path program 41 times [2019-09-08 06:21:07,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:07,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:07,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:21:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:07,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:07,763 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:21:07,795 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 06:21:07,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:07,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:21:07,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 06:21:08,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:08,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 31 [2019-09-08 06:21:08,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 06:21:08,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 06:21:08,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:21:08,408 INFO L87 Difference]: Start difference. First operand 244 states and 356 transitions. Second operand 31 states. [2019-09-08 06:21:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:09,466 INFO L93 Difference]: Finished difference Result 289 states and 419 transitions. [2019-09-08 06:21:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:21:09,467 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 77 [2019-09-08 06:21:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:09,468 INFO L225 Difference]: With dead ends: 289 [2019-09-08 06:21:09,469 INFO L226 Difference]: Without dead ends: 285 [2019-09-08 06:21:09,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 06:21:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-08 06:21:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 251. [2019-09-08 06:21:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-08 06:21:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2019-09-08 06:21:09,483 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 77 [2019-09-08 06:21:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:09,483 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2019-09-08 06:21:09,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 06:21:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2019-09-08 06:21:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:09,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:09,485 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:09,485 INFO L418 AbstractCegarLoop]: === Iteration 66 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1339038323, now seen corresponding path program 42 times [2019-09-08 06:21:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:09,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:21:10,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:10,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:21:10,217 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-08 06:21:10,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:10,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:21:10,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:13,641 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:21:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 47 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:21:13,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:13,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 45 [2019-09-08 06:21:13,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 06:21:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 06:21:13,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1866, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:21:13,664 INFO L87 Difference]: Start difference. First operand 251 states and 367 transitions. Second operand 45 states. [2019-09-08 06:21:22,452 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-08 06:21:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:24,655 INFO L93 Difference]: Finished difference Result 341 states and 498 transitions. [2019-09-08 06:21:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 06:21:24,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-08 06:21:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:24,657 INFO L225 Difference]: With dead ends: 341 [2019-09-08 06:21:24,657 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 06:21:24,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=364, Invalid=4465, Unknown=1, NotChecked=0, Total=4830 [2019-09-08 06:21:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 06:21:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 251. [2019-09-08 06:21:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-08 06:21:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2019-09-08 06:21:24,675 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 85 [2019-09-08 06:21:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:24,676 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2019-09-08 06:21:24,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 06:21:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2019-09-08 06:21:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:24,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:24,677 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:24,678 INFO L418 AbstractCegarLoop]: === Iteration 67 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -772441555, now seen corresponding path program 43 times [2019-09-08 06:21:24,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:24,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 06:21:25,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:25,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:25,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:21:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:25,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 06:21:25,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 25 proven. 52 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 06:21:29,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:29,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 43 [2019-09-08 06:21:29,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 06:21:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 06:21:29,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1697, Unknown=1, NotChecked=0, Total=1806 [2019-09-08 06:21:29,056 INFO L87 Difference]: Start difference. First operand 251 states and 367 transitions. Second operand 43 states. [2019-09-08 06:21:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:35,309 INFO L93 Difference]: Finished difference Result 374 states and 551 transitions. [2019-09-08 06:21:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 06:21:35,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2019-09-08 06:21:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:35,313 INFO L225 Difference]: With dead ends: 374 [2019-09-08 06:21:35,313 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 06:21:35,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=387, Invalid=3644, Unknown=1, NotChecked=0, Total=4032 [2019-09-08 06:21:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 06:21:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 208. [2019-09-08 06:21:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-08 06:21:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 293 transitions. [2019-09-08 06:21:35,335 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 293 transitions. Word has length 85 [2019-09-08 06:21:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:35,335 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 293 transitions. [2019-09-08 06:21:35,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 06:21:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 293 transitions. [2019-09-08 06:21:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:35,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:35,338 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:35,338 INFO L418 AbstractCegarLoop]: === Iteration 68 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1787582739, now seen corresponding path program 44 times [2019-09-08 06:21:35,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:35,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:35,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:21:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:21:36,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:36,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:21:36,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:21:36,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:36,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 06:21:36,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:21:37,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:37,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 48 [2019-09-08 06:21:37,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 06:21:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 06:21:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 06:21:37,988 INFO L87 Difference]: Start difference. First operand 208 states and 293 transitions. Second operand 48 states. [2019-09-08 06:21:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:40,912 INFO L93 Difference]: Finished difference Result 278 states and 394 transitions. [2019-09-08 06:21:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 06:21:40,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 85 [2019-09-08 06:21:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:40,916 INFO L225 Difference]: With dead ends: 278 [2019-09-08 06:21:40,916 INFO L226 Difference]: Without dead ends: 274 [2019-09-08 06:21:40,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=445, Invalid=3845, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 06:21:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-08 06:21:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 207. [2019-09-08 06:21:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 06:21:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 292 transitions. [2019-09-08 06:21:40,931 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 292 transitions. Word has length 85 [2019-09-08 06:21:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:40,931 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 292 transitions. [2019-09-08 06:21:40,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 06:21:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 292 transitions. [2019-09-08 06:21:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:40,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:40,933 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:40,933 INFO L418 AbstractCegarLoop]: === Iteration 69 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:40,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2002555091, now seen corresponding path program 45 times [2019-09-08 06:21:40,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:40,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:40,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 5 proven. 96 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:21:41,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:41,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:21:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:42,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 06:21:42,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:42,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:21:42,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:45,910 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:21:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 47 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:21:45,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 47 [2019-09-08 06:21:45,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 06:21:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 06:21:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2043, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:21:45,933 INFO L87 Difference]: Start difference. First operand 207 states and 292 transitions. Second operand 47 states. [2019-09-08 06:21:51,625 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-08 06:21:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:53,748 INFO L93 Difference]: Finished difference Result 341 states and 497 transitions. [2019-09-08 06:21:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:21:53,748 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 85 [2019-09-08 06:21:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:53,752 INFO L225 Difference]: With dead ends: 341 [2019-09-08 06:21:53,752 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 06:21:53,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=403, Invalid=4289, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 06:21:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 06:21:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 207. [2019-09-08 06:21:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 06:21:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 292 transitions. [2019-09-08 06:21:53,771 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 292 transitions. Word has length 85 [2019-09-08 06:21:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:53,771 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 292 transitions. [2019-09-08 06:21:53,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 06:21:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 292 transitions. [2019-09-08 06:21:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:53,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:53,773 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:53,773 INFO L418 AbstractCegarLoop]: === Iteration 70 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1435958323, now seen corresponding path program 46 times [2019-09-08 06:21:53,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:53,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 06:21:55,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:55,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:55,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:21:55,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:21:55,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:55,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:21:55,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 61 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 06:21:56,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:56,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 47 [2019-09-08 06:21:56,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 06:21:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 06:21:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2035, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:21:56,773 INFO L87 Difference]: Start difference. First operand 207 states and 292 transitions. Second operand 47 states. [2019-09-08 06:21:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:59,459 INFO L93 Difference]: Finished difference Result 284 states and 406 transitions. [2019-09-08 06:21:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:21:59,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 85 [2019-09-08 06:21:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:59,462 INFO L225 Difference]: With dead ends: 284 [2019-09-08 06:21:59,462 INFO L226 Difference]: Without dead ends: 280 [2019-09-08 06:21:59,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=430, Invalid=3860, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 06:21:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-08 06:21:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 162. [2019-09-08 06:21:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-08 06:21:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2019-09-08 06:21:59,478 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 85 [2019-09-08 06:21:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:59,479 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2019-09-08 06:21:59,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 06:21:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2019-09-08 06:21:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:21:59,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:59,480 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:59,480 INFO L418 AbstractCegarLoop]: === Iteration 71 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1843867789, now seen corresponding path program 47 times [2019-09-08 06:21:59,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:59,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 5 proven. 100 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:22:00,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:00,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:22:00,365 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:00,415 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 06:22:00,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:22:00,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 06:22:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:22:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 54 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 06:22:01,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:22:01,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 35 [2019-09-08 06:22:01,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 06:22:01,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 06:22:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:22:01,683 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand 35 states. [2019-09-08 06:22:03,112 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 06:22:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:22:03,730 INFO L93 Difference]: Finished difference Result 221 states and 299 transitions. [2019-09-08 06:22:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:22:03,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 85 [2019-09-08 06:22:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:22:03,733 INFO L225 Difference]: With dead ends: 221 [2019-09-08 06:22:03,733 INFO L226 Difference]: Without dead ends: 217 [2019-09-08 06:22:03,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=309, Invalid=2343, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 06:22:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-08 06:22:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 153. [2019-09-08 06:22:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 06:22:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 205 transitions. [2019-09-08 06:22:03,747 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 205 transitions. Word has length 85 [2019-09-08 06:22:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:22:03,748 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 205 transitions. [2019-09-08 06:22:03,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 06:22:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 205 transitions. [2019-09-08 06:22:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 06:22:03,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:22:03,749 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:22:03,750 INFO L418 AbstractCegarLoop]: === Iteration 72 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:22:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:22:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1524215777, now seen corresponding path program 48 times [2019-09-08 06:22:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:22:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:22:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:03,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:22:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 3 proven. 134 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:22:04,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:04,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:04,795 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:22:04,835 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 06:22:04,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:22:04,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 06:22:04,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:22:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 06:22:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:22:12,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23] total 48 [2019-09-08 06:22:12,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 06:22:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 06:22:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2138, Unknown=5, NotChecked=0, Total=2256 [2019-09-08 06:22:12,907 INFO L87 Difference]: Start difference. First operand 153 states and 205 transitions. Second operand 48 states. [2019-09-08 06:22:16,656 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-08 06:22:18,385 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-09-08 06:22:20,484 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:22:21,927 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-08 06:22:22,803 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:22:23,990 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 06:22:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:22:24,576 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2019-09-08 06:22:24,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:22:24,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-09-08 06:22:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:22:24,579 INFO L225 Difference]: With dead ends: 285 [2019-09-08 06:22:24,579 INFO L226 Difference]: Without dead ends: 281 [2019-09-08 06:22:24,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=504, Invalid=4747, Unknown=5, NotChecked=0, Total=5256 [2019-09-08 06:22:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-08 06:22:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 110. [2019-09-08 06:22:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 06:22:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-09-08 06:22:24,590 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 93 [2019-09-08 06:22:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:22:24,591 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-09-08 06:22:24,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 06:22:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2019-09-08 06:22:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 06:22:24,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:22:24,592 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:22:24,593 INFO L418 AbstractCegarLoop]: === Iteration 73 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:22:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:22:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1850710310, now seen corresponding path program 49 times [2019-09-08 06:22:24,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:22:24,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:22:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:24,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:22:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:22:25,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:25,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:22:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:25,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 06:22:25,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:22:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 06:22:25,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:22:25,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 34 [2019-09-08 06:22:25,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:22:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:22:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:22:25,707 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand 34 states. [2019-09-08 06:22:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:22:27,006 INFO L93 Difference]: Finished difference Result 130 states and 167 transitions. [2019-09-08 06:22:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:22:27,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-09-08 06:22:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:22:27,008 INFO L225 Difference]: With dead ends: 130 [2019-09-08 06:22:27,009 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 06:22:27,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:22:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 06:22:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2019-09-08 06:22:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 06:22:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2019-09-08 06:22:27,019 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 76 [2019-09-08 06:22:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:22:27,020 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2019-09-08 06:22:27,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:22:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2019-09-08 06:22:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 06:22:27,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:22:27,021 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:22:27,021 INFO L418 AbstractCegarLoop]: === Iteration 74 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:22:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:22:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash 830735302, now seen corresponding path program 50 times [2019-09-08 06:22:27,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:22:27,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:22:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:22:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:22:27,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:27,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:22:27,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:22:27,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:22:27,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:22:27,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:22:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 06:22:32,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:22:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 35 [2019-09-08 06:22:32,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 06:22:32,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 06:22:32,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1103, Unknown=3, NotChecked=0, Total=1190 [2019-09-08 06:22:32,133 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand 35 states. [2019-09-08 06:22:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:22:33,294 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2019-09-08 06:22:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:22:33,294 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 76 [2019-09-08 06:22:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:22:33,296 INFO L225 Difference]: With dead ends: 146 [2019-09-08 06:22:33,296 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 06:22:33,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=192, Invalid=1967, Unknown=3, NotChecked=0, Total=2162 [2019-09-08 06:22:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 06:22:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2019-09-08 06:22:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 06:22:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2019-09-08 06:22:33,305 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 76 [2019-09-08 06:22:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:22:33,305 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2019-09-08 06:22:33,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 06:22:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2019-09-08 06:22:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 06:22:33,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:22:33,307 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:22:33,307 INFO L418 AbstractCegarLoop]: === Iteration 75 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:22:33,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:22:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1538440314, now seen corresponding path program 51 times [2019-09-08 06:22:33,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:22:33,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:22:33,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:33,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:22:33,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:22:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:33,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:22:34,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:22:34,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:22:34,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 06:22:34,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:23:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 06:23:26,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:23:26,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 37 [2019-09-08 06:23:26,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 06:23:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 06:23:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1220, Unknown=22, NotChecked=0, Total=1332 [2019-09-08 06:23:26,508 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand 37 states. [2019-09-08 06:24:23,828 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 06:24:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:24:28,076 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2019-09-08 06:24:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:24:28,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-08 06:24:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:24:28,078 INFO L225 Difference]: With dead ends: 154 [2019-09-08 06:24:28,079 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 06:24:28,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=200, Invalid=2130, Unknown=22, NotChecked=0, Total=2352 [2019-09-08 06:24:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 06:24:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2019-09-08 06:24:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-08 06:24:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2019-09-08 06:24:28,090 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 76 [2019-09-08 06:24:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:24:28,090 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2019-09-08 06:24:28,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 06:24:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2019-09-08 06:24:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 06:24:28,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:24:28,092 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:24:28,092 INFO L418 AbstractCegarLoop]: === Iteration 76 === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:24:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:24:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1736551974, now seen corresponding path program 9 times [2019-09-08 06:24:28,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:24:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:24:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:24:28,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:24:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:24:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:24:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:24:28,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:24:28,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:24:28,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:24:28,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:24:28,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:24:28,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:24:28,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:24:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:25:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 49 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 06:25:31,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:25:31,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 44 [2019-09-08 06:25:31,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 06:25:31,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 06:25:31,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1766, Unknown=28, NotChecked=0, Total=1892 [2019-09-08 06:25:31,102 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand 44 states. [2019-09-08 06:26:19,195 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 37