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