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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:05,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:05,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:05,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:05,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:05,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:05,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:05,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:05,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:05,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:05,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:05,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:05,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:05,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:05,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:05,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:05,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:05,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:05,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:05,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:05,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:05,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:05,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:05,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:05,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:05,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:05,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:05,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:05,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:05,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:05,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:05,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:05,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:05,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:05,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:05,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:05,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:05,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:05,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:05,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:05,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:05,285 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 01:10:05,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:05,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:05,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:05,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:05,312 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:05,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:05,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:05,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:05,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:05,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:05,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:05,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:05,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:05,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:05,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:05,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:05,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:05,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:05,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:05,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:05,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:05,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:05,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:05,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:05,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:05,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:05,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:05,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:05,365 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:05,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2019-09-08 01:10:05,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989a207dc/74fd6a917a1e4a27b80807a1e73a3646/FLAGdbbd00898 [2019-09-08 01:10:05,886 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:05,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2019-09-08 01:10:05,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989a207dc/74fd6a917a1e4a27b80807a1e73a3646/FLAGdbbd00898 [2019-09-08 01:10:06,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989a207dc/74fd6a917a1e4a27b80807a1e73a3646 [2019-09-08 01:10:06,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:06,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:06,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:06,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:06,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:06,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e3444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06, skipping insertion in model container [2019-09-08 01:10:06,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,326 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:06,349 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:06,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:06,547 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:06,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:06,581 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:06,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06 WrapperNode [2019-09-08 01:10:06,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:06,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:06,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:06,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:06,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (1/1) ... [2019-09-08 01:10:06,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:06,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:06,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:06,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:06,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (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 01:10:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:06,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:06,953 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:06,953 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 01:10:06,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:06 BoogieIcfgContainer [2019-09-08 01:10:06,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:06,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:06,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:06,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:06,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:06" (1/3) ... [2019-09-08 01:10:06,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610c76d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:06, skipping insertion in model container [2019-09-08 01:10:06,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:06" (2/3) ... [2019-09-08 01:10:06,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610c76d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:06, skipping insertion in model container [2019-09-08 01:10:06,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:06" (3/3) ... [2019-09-08 01:10:06,985 INFO L109 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2019-09-08 01:10:07,004 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:07,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:07,049 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:07,080 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:07,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:07,081 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:07,081 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:07,081 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:07,081 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:07,082 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:07,082 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:07,082 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-08 01:10:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:10:07,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,105 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash -509317623, now seen corresponding path program 1 times [2019-09-08 01:10:07,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,250 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 01:10:07,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:07,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:07,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:07,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:07,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:07,272 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-09-08 01:10:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:07,305 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-09-08 01:10:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:07,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-08 01:10:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:07,317 INFO L225 Difference]: With dead ends: 30 [2019-09-08 01:10:07,317 INFO L226 Difference]: Without dead ends: 15 [2019-09-08 01:10:07,320 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 01:10:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-08 01:10:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-08 01:10:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 01:10:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-08 01:10:07,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-08 01:10:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:07,358 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-08 01:10:07,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-08 01:10:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:10:07,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,363 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash -472704980, now seen corresponding path program 1 times [2019-09-08 01:10:07,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:07,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:07,427 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 01:10:07,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:07,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:07,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:07,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:07,493 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2019-09-08 01:10:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:07,512 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-08 01:10:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:07,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-08 01:10:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:07,515 INFO L225 Difference]: With dead ends: 23 [2019-09-08 01:10:07,515 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 01:10:07,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 01:10:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-08 01:10:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-08 01:10:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-08 01:10:07,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-09-08 01:10:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:07,521 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-08 01:10:07,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-08 01:10:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:10:07,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,523 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,523 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash 662286953, now seen corresponding path program 2 times [2019-09-08 01:10:07,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:07,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:07,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:07,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 01:10:07,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:07,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:07,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 01:10:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:10:07,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 01:10:07,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:07,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:07,655 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-09-08 01:10:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:07,718 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-08 01:10:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:07,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-08 01:10:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:07,720 INFO L225 Difference]: With dead ends: 26 [2019-09-08 01:10:07,720 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 01:10:07,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 01:10:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 01:10:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-08 01:10:07,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-08 01:10:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:07,726 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-08 01:10:07,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-08 01:10:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:10:07,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,727 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,728 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1502402545, now seen corresponding path program 1 times [2019-09-08 01:10:07,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:07,805 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 01:10:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:07,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:07,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:07,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:07,867 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-08 01:10:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:07,887 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-08 01:10:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:07,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-09-08 01:10:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:07,888 INFO L225 Difference]: With dead ends: 25 [2019-09-08 01:10:07,888 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:10:07,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:10:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 01:10:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 01:10:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-08 01:10:07,893 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-09-08 01:10:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:07,894 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-08 01:10:07,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-08 01:10:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:10:07,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,895 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,895 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1307956974, now seen corresponding path program 2 times [2019-09-08 01:10:07,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:07,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:07,956 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 01:10:07,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:07,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:07,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:07,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:07,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:08,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:08,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:08,012 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-08 01:10:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,033 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-09-08 01:10:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:08,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-08 01:10:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,034 INFO L225 Difference]: With dead ends: 26 [2019-09-08 01:10:08,034 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 01:10:08,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 01:10:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 01:10:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 01:10:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:10:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-08 01:10:08,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-08 01:10:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,043 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-08 01:10:08,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-08 01:10:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:10:08,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,045 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,045 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -424888431, now seen corresponding path program 3 times [2019-09-08 01:10:08,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,166 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 01:10:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:10:08,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:08,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:08,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:08,249 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-08 01:10:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,266 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-08 01:10:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:08,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-09-08 01:10:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,268 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:10:08,268 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:10:08,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:10:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:10:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:10:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 01:10:08,272 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-08 01:10:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,272 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 01:10:08,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 01:10:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:10:08,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,273 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,274 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1691478862, now seen corresponding path program 4 times [2019-09-08 01:10:08,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:08,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:08,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:08,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:08,426 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-08 01:10:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,465 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-08 01:10:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:08,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-09-08 01:10:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,467 INFO L225 Difference]: With dead ends: 28 [2019-09-08 01:10:08,467 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 01:10:08,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 01:10:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 01:10:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:10:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 01:10:08,477 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-08 01:10:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,477 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 01:10:08,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 01:10:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:10:08,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,478 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,479 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1420611791, now seen corresponding path program 5 times [2019-09-08 01:10:08,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,605 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 01:10:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,653 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 01:10:08,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:08,678 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-08 01:10:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,708 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-08 01:10:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:08,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-08 01:10:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,709 INFO L225 Difference]: With dead ends: 29 [2019-09-08 01:10:08,710 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:10:08,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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 01:10:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:10:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 01:10:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 01:10:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-09-08 01:10:08,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-09-08 01:10:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,721 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-09-08 01:10:08,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-09-08 01:10:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:10:08,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,727 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,728 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash 888825774, now seen corresponding path program 6 times [2019-09-08 01:10:08,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,859 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) [2019-09-08 01:10:08,883 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 01:10:08,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:08,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:08,925 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2019-09-08 01:10:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,953 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-08 01:10:08,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:08,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-09-08 01:10:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,955 INFO L225 Difference]: With dead ends: 30 [2019-09-08 01:10:08,955 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 01:10:08,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 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 01:10:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 01:10:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 01:10:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:10:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 01:10:08,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-08 01:10:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,960 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 01:10:08,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 01:10:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 01:10:08,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,961 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,961 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash -533053743, now seen corresponding path program 7 times [2019-09-08 01:10:08,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,092 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 01:10:09,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:09,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:09,156 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-09-08 01:10:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,178 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-08 01:10:09,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:09,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-09-08 01:10:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,179 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:10:09,179 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:10:09,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 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 01:10:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:10:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 01:10:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 01:10:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-08 01:10:09,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-09-08 01:10:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,184 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-08 01:10:09,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-08 01:10:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:10:09,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,186 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1661645810, now seen corresponding path program 8 times [2019-09-08 01:10:09,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:10:09,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:09,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:09,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:10:09,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:10:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:10:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:09,374 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-09-08 01:10:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,412 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-08 01:10:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:10:09,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-08 01:10:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,414 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:10:09,414 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 01:10:09,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 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 01:10:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 01:10:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-08 01:10:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:10:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-08 01:10:09,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-09-08 01:10:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,426 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-08 01:10:09,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:10:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-08 01:10:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 01:10:09,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,428 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2006705777, now seen corresponding path program 9 times [2019-09-08 01:10:09,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,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 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 01:10:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:09,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 01:10:09,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:10:09,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:10:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:10:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:09,672 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 14 states. [2019-09-08 01:10:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,699 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-08 01:10:09,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:10:09,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-09-08 01:10:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,700 INFO L225 Difference]: With dead ends: 33 [2019-09-08 01:10:09,700 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 01:10:09,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 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 01:10:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 01:10:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-08 01:10:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 01:10:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-08 01:10:09,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-09-08 01:10:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,705 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-08 01:10:09,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:10:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-08 01:10:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:10:09,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,706 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,706 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -238512018, now seen corresponding path program 10 times [2019-09-08 01:10:09,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,866 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) [2019-09-08 01:10:09,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:09,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:10:09,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:10:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:10:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:09,920 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 15 states. [2019-09-08 01:10:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,946 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 01:10:09,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:10:09,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-09-08 01:10:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,948 INFO L225 Difference]: With dead ends: 34 [2019-09-08 01:10:09,948 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 01:10:09,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 01:10:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-08 01:10:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:10:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 01:10:09,952 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-09-08 01:10:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,953 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 01:10:09,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:10:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 01:10:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:10:09,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,954 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,954 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1120786927, now seen corresponding path program 11 times [2019-09-08 01:10:09,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:10:10,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:10,130 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 01:10:10,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:10,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:10:10,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:10:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:10:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:10,149 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-09-08 01:10:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,177 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-08 01:10:10,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:10:10,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-09-08 01:10:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,179 INFO L225 Difference]: With dead ends: 35 [2019-09-08 01:10:10,179 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:10:10,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 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 01:10:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:10:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 01:10:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 01:10:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-08 01:10:10,183 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-09-08 01:10:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,184 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-08 01:10:10,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:10:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-08 01:10:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:10:10,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,185 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,185 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1593461966, now seen corresponding path program 12 times [2019-09-08 01:10:10,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:10,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,359 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) [2019-09-08 01:10:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:10,422 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-08 01:10:10,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:10,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:10:10,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:10:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:10:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:10,452 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 17 states. [2019-09-08 01:10:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,504 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 01:10:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:10:10,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-09-08 01:10:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,505 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:10:10,505 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 01:10:10,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 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 01:10:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 01:10:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-08 01:10:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:10:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 01:10:10,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-09-08 01:10:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,510 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 01:10:10,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:10:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 01:10:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 01:10:10,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,511 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,511 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -164168271, now seen corresponding path program 13 times [2019-09-08 01:10:10,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:10:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:10:10,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:10:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:10:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:10,747 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 18 states. [2019-09-08 01:10:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,783 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-08 01:10:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:10:10,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-09-08 01:10:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,784 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:10:10,784 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:10:10,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 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 01:10:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:10:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 01:10:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 01:10:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-08 01:10:10,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-09-08 01:10:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,789 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-08 01:10:10,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:10:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-08 01:10:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:10:10,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,790 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,791 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1183869230, now seen corresponding path program 14 times [2019-09-08 01:10:10,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,983 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:10,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:11,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:11,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:11,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:11,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:10:11,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:10:11,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:10:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:11,046 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 19 states. [2019-09-08 01:10:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:11,077 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-08 01:10:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:10:11,078 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-09-08 01:10:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:11,079 INFO L225 Difference]: With dead ends: 38 [2019-09-08 01:10:11,079 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 01:10:11,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 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 01:10:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 01:10:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 01:10:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:10:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 01:10:11,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-09-08 01:10:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:11,086 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 01:10:11,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:10:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 01:10:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 01:10:11,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:11,087 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:11,087 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:11,087 INFO L82 PathProgramCache]: Analyzing trace with hash 23358801, now seen corresponding path program 15 times [2019-09-08 01:10:11,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:11,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:11,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:11,268 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) [2019-09-08 01:10:11,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:11,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:10:11,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:11,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:10:11,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:10:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:10:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:11,361 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 20 states. [2019-09-08 01:10:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:11,384 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-08 01:10:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:10:11,384 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-09-08 01:10:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:11,385 INFO L225 Difference]: With dead ends: 39 [2019-09-08 01:10:11,385 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:10:11,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:10:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 01:10:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 01:10:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-08 01:10:11,390 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-09-08 01:10:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:11,390 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-08 01:10:11,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:10:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-08 01:10:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:10:11,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:11,391 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:11,391 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1592726130, now seen corresponding path program 16 times [2019-09-08 01:10:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:11,600 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 01:10:11,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:11,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:11,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:11,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:10:11,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:10:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:10:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:11,669 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2019-09-08 01:10:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:11,695 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-08 01:10:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:10:11,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-09-08 01:10:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:11,696 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:10:11,696 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 01:10:11,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 01:10:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 01:10:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:10:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-08 01:10:11,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-09-08 01:10:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-08 01:10:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:10:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-08 01:10:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:10:11,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:11,702 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:11,702 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash -151751439, now seen corresponding path program 17 times [2019-09-08 01:10:11,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:11,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:12,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:12,064 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-08 01:10:12,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:12,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:10:12,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:10:12,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:10:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:10:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:12,096 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-09-08 01:10:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,130 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-08 01:10:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:10:12,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-09-08 01:10:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,131 INFO L225 Difference]: With dead ends: 41 [2019-09-08 01:10:12,131 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 01:10:12,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 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 01:10:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 01:10:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-08 01:10:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 01:10:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-08 01:10:12,136 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2019-09-08 01:10:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,137 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-08 01:10:12,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:10:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-08 01:10:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 01:10:12,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,138 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,138 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1568791022, now seen corresponding path program 18 times [2019-09-08 01:10:12,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,442 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 01:10:12,457 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:12,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-08 01:10:12,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:12,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:10:12,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:10:12,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:10:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:10:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:12,509 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 23 states. [2019-09-08 01:10:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,568 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-08 01:10:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:10:12,569 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-09-08 01:10:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,570 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:10:12,570 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 01:10:12,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 01:10:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-08 01:10:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:10:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 01:10:12,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-09-08 01:10:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,574 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 01:10:12,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:10:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 01:10:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 01:10:12,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,575 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,575 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -928967535, now seen corresponding path program 19 times [2019-09-08 01:10:12,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:10:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:10:12,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:10:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:10:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:12,897 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 24 states. [2019-09-08 01:10:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,920 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-08 01:10:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:10:12,922 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-09-08 01:10:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,922 INFO L225 Difference]: With dead ends: 43 [2019-09-08 01:10:12,922 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:10:12,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:10:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-08 01:10:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 01:10:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-08 01:10:12,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-09-08 01:10:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,927 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-08 01:10:12,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:10:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-08 01:10:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:10:12,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,928 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,928 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1050071474, now seen corresponding path program 20 times [2019-09-08 01:10:12,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:13,213 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) [2019-09-08 01:10:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:13,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:13,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:13,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:10:13,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:10:13,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:10:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:10:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:13,270 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 25 states. [2019-09-08 01:10:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:13,301 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:10:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:10:13,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-09-08 01:10:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:13,302 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:10:13,302 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 01:10:13,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 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 01:10:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 01:10:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-08 01:10:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 01:10:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-08 01:10:13,309 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-09-08 01:10:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:13,309 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-08 01:10:13,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:10:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-08 01:10:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 01:10:13,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:13,311 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:13,312 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash -509326287, now seen corresponding path program 21 times [2019-09-08 01:10:13,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:13,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:13,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:13,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 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 01:10:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:13,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-08 01:10:13,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:10:13,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:13,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:10:13,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:10:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:10:13,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:13,720 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 26 states. [2019-09-08 01:10:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:13,758 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-08 01:10:13,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:10:13,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-09-08 01:10:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:13,760 INFO L225 Difference]: With dead ends: 45 [2019-09-08 01:10:13,760 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 01:10:13,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 01:10:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-08 01:10:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:10:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-09-08 01:10:13,765 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-09-08 01:10:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:13,765 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-09-08 01:10:13,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:10:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-09-08 01:10:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:10:13,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:13,766 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:13,767 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash -926094674, now seen corresponding path program 22 times [2019-09-08 01:10:13,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:14,107 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 01:10:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:14,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:14,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:14,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:10:14,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:14,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:14,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:10:14,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:10:14,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:10:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:14,199 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 27 states. [2019-09-08 01:10:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:14,237 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-08 01:10:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:10:14,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-09-08 01:10:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:14,239 INFO L225 Difference]: With dead ends: 46 [2019-09-08 01:10:14,239 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 01:10:14,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 01:10:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 01:10:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:10:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 01:10:14,243 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-09-08 01:10:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:14,243 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 01:10:14,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:10:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 01:10:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 01:10:14,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:14,244 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:14,244 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -961012783, now seen corresponding path program 23 times [2019-09-08 01:10:14,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:14,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:14,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:14,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:14,609 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 01:10:14,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:14,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-08 01:10:14,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:14,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:10:14,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:14,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:10:14,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:10:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:10:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:10:14,689 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 28 states. [2019-09-08 01:10:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:14,732 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-08 01:10:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:10:14,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2019-09-08 01:10:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:14,733 INFO L225 Difference]: With dead ends: 47 [2019-09-08 01:10:14,733 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:10:14,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 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 01:10:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:10:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 01:10:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 01:10:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-08 01:10:14,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2019-09-08 01:10:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:14,739 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-08 01:10:14,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:10:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-08 01:10:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:10:14,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:14,740 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:14,740 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2043474162, now seen corresponding path program 24 times [2019-09-08 01:10:14,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:14,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:15,110 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 01:10:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:15,186 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-08 01:10:15,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:15,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:10:15,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:15,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:10:15,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:10:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:10:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:15,205 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 29 states. [2019-09-08 01:10:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:15,245 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-08 01:10:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:10:15,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2019-09-08 01:10:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:15,247 INFO L225 Difference]: With dead ends: 48 [2019-09-08 01:10:15,247 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 01:10:15,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 01:10:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-08 01:10:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 01:10:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-08 01:10:15,251 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-09-08 01:10:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:15,251 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-08 01:10:15,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:10:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-08 01:10:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 01:10:15,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:15,252 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:15,252 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1240038543, now seen corresponding path program 25 times [2019-09-08 01:10:15,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:15,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:15,662 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 01:10:15,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:10:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 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 01:10:15,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:15,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:10:15,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:10:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:10:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:15,742 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 30 states. [2019-09-08 01:10:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:15,783 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-09-08 01:10:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:10:15,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2019-09-08 01:10:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:15,784 INFO L225 Difference]: With dead ends: 49 [2019-09-08 01:10:15,784 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:10:15,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:10:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 01:10:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 01:10:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-08 01:10:15,792 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-09-08 01:10:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:15,793 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-08 01:10:15,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:10:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-08 01:10:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:10:15,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:15,793 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:15,794 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2103338130, now seen corresponding path program 26 times [2019-09-08 01:10:15,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:16,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:16,246 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 01:10:16,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:16,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:16,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:16,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:10:16,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:10:16,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:10:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:10:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:10:16,335 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 31 states. [2019-09-08 01:10:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:16,383 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-08 01:10:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:10:16,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-09-08 01:10:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:16,384 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:10:16,384 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 01:10:16,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 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 01:10:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 01:10:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-08 01:10:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:10:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-09-08 01:10:16,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-09-08 01:10:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:16,391 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-09-08 01:10:16,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:10:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-09-08 01:10:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 01:10:16,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:16,392 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:16,392 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1199145745, now seen corresponding path program 27 times [2019-09-08 01:10:16,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:16,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:16,902 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 01:10:16,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:16,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:10:16,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:10:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:17,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:10:17,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:10:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:10:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:10:17,004 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 32 states. [2019-09-08 01:10:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:17,052 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-08 01:10:17,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:10:17,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2019-09-08 01:10:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:17,053 INFO L225 Difference]: With dead ends: 51 [2019-09-08 01:10:17,053 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 01:10:17,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 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 01:10:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 01:10:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 01:10:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 01:10:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-09-08 01:10:17,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-09-08 01:10:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:17,057 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-09-08 01:10:17,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:10:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-09-08 01:10:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 01:10:17,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:17,058 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:17,059 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash 496930766, now seen corresponding path program 28 times [2019-09-08 01:10:17,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:17,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:17,714 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 01:10:17,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:17,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:17,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:17,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:10:17,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:10:17,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:10:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:10:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:17,781 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2019-09-08 01:10:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:17,829 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-08 01:10:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:10:17,830 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-09-08 01:10:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:17,830 INFO L225 Difference]: With dead ends: 52 [2019-09-08 01:10:17,830 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 01:10:17,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 01:10:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-08 01:10:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 01:10:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-08 01:10:17,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-09-08 01:10:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:17,834 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-08 01:10:17,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:10:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-08 01:10:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 01:10:17,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:17,835 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:17,836 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash 203102897, now seen corresponding path program 29 times [2019-09-08 01:10:17,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:18,273 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 01:10:18,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:18,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-08 01:10:18,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:18,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:10:18,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:10:18,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:10:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:10:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:10:18,362 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 34 states. [2019-09-08 01:10:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:18,403 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-08 01:10:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:10:18,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-09-08 01:10:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:18,405 INFO L225 Difference]: With dead ends: 53 [2019-09-08 01:10:18,405 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:10:18,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 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 01:10:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:10:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 01:10:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 01:10:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-09-08 01:10:18,410 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2019-09-08 01:10:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:18,410 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-09-08 01:10:18,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:10:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-09-08 01:10:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:10:18,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:18,411 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:18,411 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash -315626450, now seen corresponding path program 30 times [2019-09-08 01:10:18,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:18,849 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 01:10:18,860 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:18,902 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-08 01:10:18,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:18,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:10:18,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:18,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:10:18,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:10:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:10:18,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:18,920 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 35 states. [2019-09-08 01:10:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:18,953 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-09-08 01:10:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:10:18,953 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-09-08 01:10:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:18,954 INFO L225 Difference]: With dead ends: 54 [2019-09-08 01:10:18,954 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:10:18,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:10:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-08 01:10:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 01:10:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-08 01:10:18,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-09-08 01:10:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:18,960 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-08 01:10:18,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:10:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-08 01:10:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 01:10:18,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:18,961 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:18,961 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 783632977, now seen corresponding path program 31 times [2019-09-08 01:10:18,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:18,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:19,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:19,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:10:19,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:10:19,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:10:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:10:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:19,578 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 36 states. [2019-09-08 01:10:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:19,625 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-08 01:10:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:10:19,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2019-09-08 01:10:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:19,627 INFO L225 Difference]: With dead ends: 55 [2019-09-08 01:10:19,627 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 01:10:19,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 01:10:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-08 01:10:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:10:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-08 01:10:19,630 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-09-08 01:10:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:19,630 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-08 01:10:19,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:10:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-08 01:10:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:10:19,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:19,634 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:19,635 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash 500936846, now seen corresponding path program 32 times [2019-09-08 01:10:19,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:19,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:19,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:19,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:20,116 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 01:10:20,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:20,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:20,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:20,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:10:20,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:20,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:10:20,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:10:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:10:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:10:20,189 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 37 states. [2019-09-08 01:10:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:20,222 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-08 01:10:20,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:10:20,222 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2019-09-08 01:10:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:20,223 INFO L225 Difference]: With dead ends: 56 [2019-09-08 01:10:20,223 INFO L226 Difference]: Without dead ends: 49 [2019-09-08 01:10:20,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 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 01:10:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-08 01:10:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-08 01:10:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 01:10:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-08 01:10:20,227 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-09-08 01:10:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:20,227 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-08 01:10:20,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:10:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-08 01:10:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 01:10:20,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:20,228 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:20,228 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 327291377, now seen corresponding path program 33 times [2019-09-08 01:10:20,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:20,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:20,821 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 01:10:20,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:20,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-08 01:10:20,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:20,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:10:20,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:20,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:10:20,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:10:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:10:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:10:20,895 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 38 states. [2019-09-08 01:10:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:20,942 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-09-08 01:10:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:10:20,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2019-09-08 01:10:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:20,944 INFO L225 Difference]: With dead ends: 57 [2019-09-08 01:10:20,944 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 01:10:20,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 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 01:10:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 01:10:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-08 01:10:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 01:10:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-08 01:10:20,949 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2019-09-08 01:10:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:20,949 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-08 01:10:20,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:10:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-08 01:10:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 01:10:20,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:20,950 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:20,951 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -760750866, now seen corresponding path program 34 times [2019-09-08 01:10:20,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:20,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:20,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:20,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:21,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:21,541 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 01:10:21,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:21,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:21,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:21,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:10:21,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:10:21,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:10:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:10:21,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:10:21,605 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 39 states. [2019-09-08 01:10:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:21,654 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-08 01:10:21,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:10:21,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2019-09-08 01:10:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:21,655 INFO L225 Difference]: With dead ends: 58 [2019-09-08 01:10:21,655 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 01:10:21,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 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 01:10:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 01:10:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-08 01:10:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 01:10:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-08 01:10:21,659 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-09-08 01:10:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:21,661 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-08 01:10:21,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:10:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-08 01:10:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 01:10:21,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:21,662 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:21,662 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -130322031, now seen corresponding path program 35 times [2019-09-08 01:10:21,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:21,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:21,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:22,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:22,391 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 01:10:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:22,449 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-08 01:10:22,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:22,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:10:22,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:22,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:22,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:10:22,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:10:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:10:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:10:22,466 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 40 states. [2019-09-08 01:10:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:22,528 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-08 01:10:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:10:22,529 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-09-08 01:10:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:22,529 INFO L225 Difference]: With dead ends: 59 [2019-09-08 01:10:22,530 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 01:10:22,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:10:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 01:10:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-08 01:10:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 01:10:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-09-08 01:10:22,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-09-08 01:10:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:22,533 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-09-08 01:10:22,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:10:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-09-08 01:10:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 01:10:22,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:22,534 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:22,534 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2061864626, now seen corresponding path program 36 times [2019-09-08 01:10:22,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:22,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:22,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:23,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:23,167 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 01:10:23,179 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:23,228 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-08 01:10:23,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:23,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:10:23,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:23,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:10:23,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:10:23,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:10:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:10:23,264 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 41 states. [2019-09-08 01:10:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:23,315 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-08 01:10:23,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:10:23,316 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-09-08 01:10:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:23,317 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:10:23,317 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 01:10:23,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:10:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 01:10:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-08 01:10:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:10:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-09-08 01:10:23,321 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-09-08 01:10:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:23,322 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-09-08 01:10:23,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:10:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-09-08 01:10:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 01:10:23,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:23,322 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:23,323 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1810142927, now seen corresponding path program 37 times [2019-09-08 01:10:23,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:23,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:23,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:23,950 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 01:10:23,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:24,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:10:24,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:24,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:24,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:10:24,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:10:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:10:24,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:10:24,020 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 42 states. [2019-09-08 01:10:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:24,071 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-08 01:10:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:10:24,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2019-09-08 01:10:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:24,073 INFO L225 Difference]: With dead ends: 61 [2019-09-08 01:10:24,073 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 01:10:24,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:10:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 01:10:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-08 01:10:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 01:10:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-08 01:10:24,076 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-09-08 01:10:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:24,076 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-08 01:10:24,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:10:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-08 01:10:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:10:24,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:24,077 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:24,077 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1698262446, now seen corresponding path program 38 times [2019-09-08 01:10:24,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:24,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:24,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:24,832 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 01:10:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:24,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:24,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:24,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:10:24,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:24,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:24,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:10:24,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:10:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:10:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:10:24,903 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 43 states. [2019-09-08 01:10:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:24,942 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-08 01:10:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:10:24,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2019-09-08 01:10:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:24,943 INFO L225 Difference]: With dead ends: 62 [2019-09-08 01:10:24,943 INFO L226 Difference]: Without dead ends: 55 [2019-09-08 01:10:24,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 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 01:10:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-08 01:10:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-08 01:10:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 01:10:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-08 01:10:24,947 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-09-08 01:10:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:24,947 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-08 01:10:24,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:10:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-08 01:10:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 01:10:24,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:24,948 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:24,948 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1210320687, now seen corresponding path program 39 times [2019-09-08 01:10:24,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:26,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:26,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:26,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 01:10:26,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:26,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:10:26,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:26,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:10:26,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:10:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:10:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:10:26,106 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 44 states. [2019-09-08 01:10:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:26,167 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-08 01:10:26,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:10:26,167 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2019-09-08 01:10:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:26,168 INFO L225 Difference]: With dead ends: 63 [2019-09-08 01:10:26,168 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 01:10:26,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:10:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 01:10:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-08 01:10:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 01:10:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-08 01:10:26,172 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 53 [2019-09-08 01:10:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:26,172 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-08 01:10:26,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:10:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-08 01:10:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 01:10:26,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:26,173 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:26,173 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1182084594, now seen corresponding path program 40 times [2019-09-08 01:10:26,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:26,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:26,886 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 01:10:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:26,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:26,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:26,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:10:26,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:10:26,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:10:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:10:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:10:26,965 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 45 states. [2019-09-08 01:10:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:27,005 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-08 01:10:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:10:27,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2019-09-08 01:10:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:27,006 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:10:27,006 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:10:27,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:10:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:10:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-08 01:10:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 01:10:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-08 01:10:27,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-09-08 01:10:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:27,011 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-08 01:10:27,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:10:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-08 01:10:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 01:10:27,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:27,013 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:27,013 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -306765711, now seen corresponding path program 41 times [2019-09-08 01:10:27,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:27,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:27,768 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 01:10:27,781 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:27,863 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-08 01:10:27,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:27,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:10:27,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:27,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:27,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:10:27,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:10:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:10:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:10:27,885 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 46 states. [2019-09-08 01:10:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:27,949 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-09-08 01:10:27,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:10:27,949 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2019-09-08 01:10:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:27,950 INFO L225 Difference]: With dead ends: 65 [2019-09-08 01:10:27,950 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 01:10:27,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 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 01:10:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 01:10:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 01:10:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:10:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-08 01:10:27,953 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 55 [2019-09-08 01:10:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:27,954 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-08 01:10:27,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:10:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-08 01:10:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 01:10:27,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:27,955 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:27,955 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1058315886, now seen corresponding path program 42 times [2019-09-08 01:10:27,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:27,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:28,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:28,784 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) [2019-09-08 01:10:28,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:28,858 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-08 01:10:28,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:28,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:10:28,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:10:28,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:10:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:10:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:10:28,878 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 47 states. [2019-09-08 01:10:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:28,949 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-08 01:10:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:10:28,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2019-09-08 01:10:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:28,950 INFO L225 Difference]: With dead ends: 66 [2019-09-08 01:10:28,950 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 01:10:28,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:10:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 01:10:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-08 01:10:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 01:10:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-08 01:10:28,954 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-09-08 01:10:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:28,954 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-08 01:10:28,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:10:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-08 01:10:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 01:10:28,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:28,955 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:28,955 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 426172433, now seen corresponding path program 43 times [2019-09-08 01:10:28,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:28,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:28,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:28,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:29,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:29,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:10:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:29,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:10:29,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:10:29,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:10:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:10:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:10:29,826 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 48 states. [2019-09-08 01:10:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:29,889 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-08 01:10:29,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:10:29,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2019-09-08 01:10:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:29,891 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:10:29,891 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 01:10:29,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:10:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 01:10:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-08 01:10:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 01:10:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-08 01:10:29,894 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-09-08 01:10:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:29,895 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-08 01:10:29,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:10:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-08 01:10:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 01:10:29,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:29,895 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:29,896 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1990405426, now seen corresponding path program 44 times [2019-09-08 01:10:29,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:29,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:30,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:30,780 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 01:10:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:30,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:30,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:30,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:10:30,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:30,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:30,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:10:30,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:10:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:10:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:10:30,854 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 49 states. [2019-09-08 01:10:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:30,939 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-08 01:10:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:10:30,940 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 58 [2019-09-08 01:10:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:30,940 INFO L225 Difference]: With dead ends: 68 [2019-09-08 01:10:30,940 INFO L226 Difference]: Without dead ends: 61 [2019-09-08 01:10:30,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 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 01:10:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-08 01:10:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-09-08 01:10:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-08 01:10:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-09-08 01:10:30,943 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-09-08 01:10:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:30,944 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-09-08 01:10:30,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:10:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-09-08 01:10:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 01:10:30,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:30,945 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:30,945 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 405092273, now seen corresponding path program 45 times [2019-09-08 01:10:30,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:30,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:30,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:31,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:31,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:31,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:31,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-08 01:10:31,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:31,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:10:31,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:31,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:31,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:10:31,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:10:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:10:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:10:31,924 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 50 states. [2019-09-08 01:10:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:31,995 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-08 01:10:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:10:31,995 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 59 [2019-09-08 01:10:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:31,996 INFO L225 Difference]: With dead ends: 69 [2019-09-08 01:10:31,996 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 01:10:31,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:10:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 01:10:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-08 01:10:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 01:10:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-08 01:10:32,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-09-08 01:10:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:32,000 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-08 01:10:32,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:10:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-08 01:10:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:10:32,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:32,001 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:32,001 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1651076910, now seen corresponding path program 46 times [2019-09-08 01:10:32,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:32,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:32,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:32,958 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 01:10:32,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:33,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:33,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:33,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:10:33,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:33,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:33,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:10:33,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:10:33,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:10:33,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:10:33,043 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 51 states. [2019-09-08 01:10:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:33,089 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-08 01:10:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:10:33,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 60 [2019-09-08 01:10:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:33,090 INFO L225 Difference]: With dead ends: 70 [2019-09-08 01:10:33,090 INFO L226 Difference]: Without dead ends: 63 [2019-09-08 01:10:33,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:10:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-08 01:10:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-08 01:10:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:10:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-08 01:10:33,096 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-09-08 01:10:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:33,096 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-08 01:10:33,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:10:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-08 01:10:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 01:10:33,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:33,097 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:33,097 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1621894993, now seen corresponding path program 47 times [2019-09-08 01:10:33,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:33,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:33,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:33,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:34,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:34,038 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 01:10:34,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:34,106 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-08 01:10:34,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:34,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:10:34,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:34,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:34,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:10:34,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:10:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:10:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:10:34,126 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 52 states. [2019-09-08 01:10:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:34,212 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-08 01:10:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:10:34,213 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 61 [2019-09-08 01:10:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:34,213 INFO L225 Difference]: With dead ends: 71 [2019-09-08 01:10:34,213 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 01:10:34,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 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 01:10:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 01:10:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-08 01:10:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-08 01:10:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-08 01:10:34,216 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-09-08 01:10:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:34,216 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-08 01:10:34,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:10:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-08 01:10:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 01:10:34,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:34,217 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:34,217 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 717255566, now seen corresponding path program 48 times [2019-09-08 01:10:34,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:35,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:35,224 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 01:10:35,235 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:35,295 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-09-08 01:10:35,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:35,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:10:35,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:35,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:35,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:10:35,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:10:35,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:10:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:10:35,316 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 53 states. [2019-09-08 01:10:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:35,414 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-08 01:10:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:10:35,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 62 [2019-09-08 01:10:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:35,416 INFO L225 Difference]: With dead ends: 72 [2019-09-08 01:10:35,416 INFO L226 Difference]: Without dead ends: 65 [2019-09-08 01:10:35,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:10:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-08 01:10:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-08 01:10:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 01:10:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-08 01:10:35,420 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-09-08 01:10:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:35,420 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-08 01:10:35,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:10:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-08 01:10:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 01:10:35,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:35,421 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:35,421 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1556762895, now seen corresponding path program 49 times [2019-09-08 01:10:35,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:35,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:36,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:36,423 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 01:10:36,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:36,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:10:36,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:36,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:36,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:10:36,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:10:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:10:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:10:36,504 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 54 states. [2019-09-08 01:10:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:36,576 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-09-08 01:10:36,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:10:36,576 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 63 [2019-09-08 01:10:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:36,577 INFO L225 Difference]: With dead ends: 73 [2019-09-08 01:10:36,577 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 01:10:36,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:10:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 01:10:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-08 01:10:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 01:10:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-08 01:10:36,582 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-09-08 01:10:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:36,582 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-08 01:10:36,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:10:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-08 01:10:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 01:10:36,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:36,583 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:36,583 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 963108846, now seen corresponding path program 50 times [2019-09-08 01:10:36,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:36,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:37,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:37,770 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 01:10:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:37,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:37,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:37,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:10:37,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:37,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:37,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:10:37,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:10:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:10:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:10:37,855 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 55 states. [2019-09-08 01:10:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,940 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-09-08 01:10:37,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:10:37,945 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 64 [2019-09-08 01:10:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,946 INFO L225 Difference]: With dead ends: 74 [2019-09-08 01:10:37,946 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 01:10:37,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:10:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 01:10:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-08 01:10:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 01:10:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-08 01:10:37,950 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-09-08 01:10:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,950 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-08 01:10:37,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:10:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-08 01:10:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 01:10:37,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,953 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,953 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1769721489, now seen corresponding path program 51 times [2019-09-08 01:10:37,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:39,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:39,029 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 01:10:39,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:39,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 01:10:39,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:10:39,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:39,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:39,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:10:39,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:10:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:10:39,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:10:39,127 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 56 states. [2019-09-08 01:10:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:39,196 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-08 01:10:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:10:39,196 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 65 [2019-09-08 01:10:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:39,197 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:10:39,197 INFO L226 Difference]: Without dead ends: 68 [2019-09-08 01:10:39,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:10:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-08 01:10:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-08 01:10:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 01:10:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-08 01:10:39,201 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-09-08 01:10:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:39,201 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-08 01:10:39,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:10:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-08 01:10:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 01:10:39,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:39,202 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:39,202 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1004909646, now seen corresponding path program 52 times [2019-09-08 01:10:39,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:40,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:40,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:10:40,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:10:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:10:40,508 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 57 states. [2019-09-08 01:10:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,573 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-08 01:10:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:10:40,573 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 66 [2019-09-08 01:10:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,574 INFO L225 Difference]: With dead ends: 76 [2019-09-08 01:10:40,574 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 01:10:40,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:10:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 01:10:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-08 01:10:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 01:10:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-08 01:10:40,579 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-09-08 01:10:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,579 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-08 01:10:40,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:10:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-08 01:10:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 01:10:40,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,581 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,581 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1229421007, now seen corresponding path program 53 times [2019-09-08 01:10:40,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:42,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:42,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:42,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:42,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-08 01:10:42,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:42,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:10:42,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:42,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:10:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:10:42,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:10:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:10:42,289 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 58 states. [2019-09-08 01:10:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:42,386 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-08 01:10:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:10:42,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2019-09-08 01:10:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:42,387 INFO L225 Difference]: With dead ends: 77 [2019-09-08 01:10:42,387 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 01:10:42,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:10:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 01:10:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-08 01:10:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-08 01:10:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-08 01:10:42,390 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-09-08 01:10:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:42,392 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-08 01:10:42,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:10:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-08 01:10:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 01:10:42,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:42,392 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:42,393 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1774194514, now seen corresponding path program 54 times [2019-09-08 01:10:42,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:43,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:44,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-09-08 01:10:44,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:10:44,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:10:44,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:10:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:10:44,034 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 59 states. [2019-09-08 01:10:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,137 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-08 01:10:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:10:44,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 68 [2019-09-08 01:10:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,138 INFO L225 Difference]: With dead ends: 78 [2019-09-08 01:10:44,138 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 01:10:44,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:10:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 01:10:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-09-08 01:10:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 01:10:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-08 01:10:44,143 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-09-08 01:10:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,144 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-08 01:10:44,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:10:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-08 01:10:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 01:10:44,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,145 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,145 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1482304047, now seen corresponding path program 55 times [2019-09-08 01:10:44,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:10:45,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:10:45,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:10:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:10:45,460 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 60 states. [2019-09-08 01:10:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,559 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-08 01:10:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:10:45,565 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 69 [2019-09-08 01:10:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,566 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:10:45,566 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 01:10:45,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:10:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 01:10:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-08 01:10:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 01:10:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-08 01:10:45,570 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-09-08 01:10:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,570 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-08 01:10:45,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:10:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-08 01:10:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 01:10:45,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,571 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,571 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1023634162, now seen corresponding path program 56 times [2019-09-08 01:10:45,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:46,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:46,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:46,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:46,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:46,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:46,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:10:46,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:46,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:46,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:10:46,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:10:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:10:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:10:46,940 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 61 states. [2019-09-08 01:10:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:46,999 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-09-08 01:10:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:10:46,999 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 70 [2019-09-08 01:10:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:47,000 INFO L225 Difference]: With dead ends: 80 [2019-09-08 01:10:47,000 INFO L226 Difference]: Without dead ends: 73 [2019-09-08 01:10:47,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:10:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-08 01:10:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-08 01:10:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:10:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-08 01:10:47,003 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-09-08 01:10:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:47,004 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-08 01:10:47,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:10:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-08 01:10:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 01:10:47,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:47,004 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:47,005 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 310230385, now seen corresponding path program 57 times [2019-09-08 01:10:47,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:48,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:48,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:48,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-09-08 01:10:48,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:48,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:10:48,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:48,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:48,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:10:48,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:10:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:10:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:10:48,474 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 62 states. [2019-09-08 01:10:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:48,567 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-09-08 01:10:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:10:48,568 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 71 [2019-09-08 01:10:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:48,569 INFO L225 Difference]: With dead ends: 81 [2019-09-08 01:10:48,569 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 01:10:48,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:10:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 01:10:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-08 01:10:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 01:10:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-08 01:10:48,573 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-09-08 01:10:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:48,573 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-08 01:10:48,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:10:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-08 01:10:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 01:10:48,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:48,575 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:48,575 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1289641618, now seen corresponding path program 58 times [2019-09-08 01:10:48,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:48,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:48,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:49,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:49,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:50,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:50,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:10:50,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:50,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:50,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:10:50,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:10:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:10:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:10:50,062 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 63 states. [2019-09-08 01:10:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,177 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-09-08 01:10:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:10:50,180 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 72 [2019-09-08 01:10:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,181 INFO L225 Difference]: With dead ends: 82 [2019-09-08 01:10:50,181 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 01:10:50,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:10:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 01:10:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-08 01:10:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 01:10:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-08 01:10:50,184 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-09-08 01:10:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,184 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-08 01:10:50,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:10:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-08 01:10:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 01:10:50,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,185 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,186 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 653933841, now seen corresponding path program 59 times [2019-09-08 01:10:50,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:51,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:51,570 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:51,658 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-08 01:10:51,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (62)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:51,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:10:51,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:10:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:10:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:10:51,685 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 64 states. [2019-09-08 01:10:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:51,752 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-08 01:10:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:10:51,753 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 73 [2019-09-08 01:10:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:51,753 INFO L225 Difference]: With dead ends: 83 [2019-09-08 01:10:51,754 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:10:51,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:10:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:10:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-08 01:10:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 01:10:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-08 01:10:51,758 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2019-09-08 01:10:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:51,758 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-08 01:10:51,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:10:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-08 01:10:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 01:10:51,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:51,759 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:51,759 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 775230926, now seen corresponding path program 60 times [2019-09-08 01:10:51,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:53,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:53,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-09-08 01:10:53,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:53,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:10:53,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:53,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:53,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:10:53,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:10:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:10:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:10:53,268 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 65 states. [2019-09-08 01:10:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:53,374 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-09-08 01:10:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:10:53,374 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 74 [2019-09-08 01:10:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:53,375 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:10:53,376 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 01:10:53,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:10:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 01:10:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-08 01:10:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 01:10:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-09-08 01:10:53,379 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-09-08 01:10:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:53,380 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-09-08 01:10:53,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:10:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-09-08 01:10:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 01:10:53,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:53,381 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:53,381 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 240473265, now seen corresponding path program 61 times [2019-09-08 01:10:53,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:53,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:53,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:54,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:54,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:54,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:10:54,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:55,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:55,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:10:55,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:10:55,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:10:55,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:10:55,007 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 66 states. [2019-09-08 01:10:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:55,112 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-08 01:10:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:10:55,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 75 [2019-09-08 01:10:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:55,114 INFO L225 Difference]: With dead ends: 85 [2019-09-08 01:10:55,115 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 01:10:55,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 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 01:10:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 01:10:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-08 01:10:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 01:10:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-08 01:10:55,118 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-09-08 01:10:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:55,119 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-08 01:10:55,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:10:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-08 01:10:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 01:10:55,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:55,120 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:55,120 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 842854958, now seen corresponding path program 62 times [2019-09-08 01:10:55,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:55,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:56,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:56,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:56,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:56,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:56,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:56,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:10:56,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:10:56,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:10:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:10:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:10:56,748 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 67 states. [2019-09-08 01:10:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:56,834 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-09-08 01:10:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:10:56,835 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 76 [2019-09-08 01:10:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:56,836 INFO L225 Difference]: With dead ends: 86 [2019-09-08 01:10:56,836 INFO L226 Difference]: Without dead ends: 79 [2019-09-08 01:10:56,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:10:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-08 01:10:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-08 01:10:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 01:10:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-08 01:10:56,840 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-09-08 01:10:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:56,840 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-08 01:10:56,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:10:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-08 01:10:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 01:10:56,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:56,842 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:56,842 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1958149039, now seen corresponding path program 63 times [2019-09-08 01:10:56,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:56,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:58,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:58,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:58,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 01:10:58,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:58,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:10:58,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (66)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:58,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:58,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:10:58,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:10:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:10:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:10:58,711 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 68 states. [2019-09-08 01:10:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:58,825 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-08 01:10:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:10:58,825 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 77 [2019-09-08 01:10:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:58,826 INFO L225 Difference]: With dead ends: 87 [2019-09-08 01:10:58,826 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 01:10:58,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:10:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 01:10:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-08 01:10:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-08 01:10:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-08 01:10:58,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-09-08 01:10:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:58,831 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-08 01:10:58,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:10:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-08 01:10:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 01:10:58,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:58,832 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:58,832 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1405040270, now seen corresponding path program 64 times [2019-09-08 01:10:58,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:00,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:00,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:00,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:00,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:00,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:00,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:11:00,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:00,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:00,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:11:00,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:11:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:11:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:11:00,960 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 69 states. [2019-09-08 01:11:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:01,094 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-08 01:11:01,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:11:01,095 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 78 [2019-09-08 01:11:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:01,096 INFO L225 Difference]: With dead ends: 88 [2019-09-08 01:11:01,096 INFO L226 Difference]: Without dead ends: 81 [2019-09-08 01:11:01,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:11:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-08 01:11:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-08 01:11:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 01:11:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-08 01:11:01,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-09-08 01:11:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:01,100 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-08 01:11:01,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:11:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-08 01:11:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 01:11:01,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:01,101 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:01,101 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1710273551, now seen corresponding path program 65 times [2019-09-08 01:11:01,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:01,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:01,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:01,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:02,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:02,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:02,894 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-09-08 01:11:02,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:02,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:11:02,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (68)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:02,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:02,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:11:02,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:11:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:11:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:11:02,920 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 70 states. [2019-09-08 01:11:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:03,029 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-09-08 01:11:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:11:03,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 79 [2019-09-08 01:11:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:03,030 INFO L225 Difference]: With dead ends: 89 [2019-09-08 01:11:03,030 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:11:03,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:11:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:11:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-08 01:11:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 01:11:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-08 01:11:03,033 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 79 [2019-09-08 01:11:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:03,034 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-08 01:11:03,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:11:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-08 01:11:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 01:11:03,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:03,035 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:03,035 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 499245806, now seen corresponding path program 66 times [2019-09-08 01:11:03,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:04,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:04,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:04,991 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:05,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-09-08 01:11:05,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:05,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:11:05,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:05,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:11:05,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:11:05,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:11:05,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:11:05,098 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 71 states. [2019-09-08 01:11:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:05,200 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-09-08 01:11:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:11:05,201 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 80 [2019-09-08 01:11:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:05,202 INFO L225 Difference]: With dead ends: 90 [2019-09-08 01:11:05,202 INFO L226 Difference]: Without dead ends: 83 [2019-09-08 01:11:05,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:11:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-08 01:11:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-08 01:11:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:11:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-09-08 01:11:05,206 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-09-08 01:11:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:05,207 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-09-08 01:11:05,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:11:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-09-08 01:11:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 01:11:05,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:05,208 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:05,208 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash 274869137, now seen corresponding path program 67 times [2019-09-08 01:11:05,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:05,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:06,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:06,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:06,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:07,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:11:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:07,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:11:07,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:11:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:11:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:11:07,064 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 72 states. [2019-09-08 01:11:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:07,166 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-08 01:11:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:11:07,166 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 81 [2019-09-08 01:11:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:07,167 INFO L225 Difference]: With dead ends: 91 [2019-09-08 01:11:07,168 INFO L226 Difference]: Without dead ends: 84 [2019-09-08 01:11:07,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:11:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-08 01:11:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-08 01:11:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-08 01:11:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-08 01:11:07,173 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2019-09-08 01:11:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:07,173 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-08 01:11:07,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:11:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-08 01:11:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 01:11:07,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:07,175 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:07,175 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1909126990, now seen corresponding path program 68 times [2019-09-08 01:11:07,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:07,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:09,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:09,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:09,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:09,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:09,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:11:09,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:09,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:09,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:11:09,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:11:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:11:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:11:09,344 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 73 states. [2019-09-08 01:11:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:09,456 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-08 01:11:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:11:09,456 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 82 [2019-09-08 01:11:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:09,457 INFO L225 Difference]: With dead ends: 92 [2019-09-08 01:11:09,457 INFO L226 Difference]: Without dead ends: 85 [2019-09-08 01:11:09,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:11:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-08 01:11:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-08 01:11:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 01:11:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-09-08 01:11:09,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-09-08 01:11:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:09,462 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-09-08 01:11:09,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:11:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-09-08 01:11:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 01:11:09,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:09,463 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:09,464 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1031512881, now seen corresponding path program 69 times [2019-09-08 01:11:09,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:11,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:11,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:11,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-09-08 01:11:11,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:11,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:11:11,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:11,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:11,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:11:11,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:11:11,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:11:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:11:11,462 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 74 states. [2019-09-08 01:11:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:11,589 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-08 01:11:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:11:11,589 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 83 [2019-09-08 01:11:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:11,590 INFO L225 Difference]: With dead ends: 93 [2019-09-08 01:11:11,591 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 01:11:11,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:11:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 01:11:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-08 01:11:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 01:11:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-08 01:11:11,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-09-08 01:11:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:11,595 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-08 01:11:11,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:11:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-08 01:11:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 01:11:11,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:11,596 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:11,596 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash -404720722, now seen corresponding path program 70 times [2019-09-08 01:11:11,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:11,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:13,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:13,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:13,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:13,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:13,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:13,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:11:13,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (73)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:11:13,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:11:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:11:13,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:11:13,602 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 75 states. [2019-09-08 01:11:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:13,764 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-09-08 01:11:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:11:13,765 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 84 [2019-09-08 01:11:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:13,765 INFO L225 Difference]: With dead ends: 94 [2019-09-08 01:11:13,766 INFO L226 Difference]: Without dead ends: 87 [2019-09-08 01:11:13,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:11:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-08 01:11:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-08 01:11:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 01:11:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-08 01:11:13,769 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-09-08 01:11:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:13,769 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-08 01:11:13,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:11:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-08 01:11:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 01:11:13,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:13,770 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:13,770 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1978289455, now seen corresponding path program 71 times [2019-09-08 01:11:13,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:13,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:13,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:15,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:15,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:15,787 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-08 01:11:15,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:15,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:11:15,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (74)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:15,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:11:15,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:11:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:11:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:11:15,814 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 76 states. [2019-09-08 01:11:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:15,947 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-08 01:11:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:11:15,948 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 85 [2019-09-08 01:11:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:15,948 INFO L225 Difference]: With dead ends: 95 [2019-09-08 01:11:15,948 INFO L226 Difference]: Without dead ends: 88 [2019-09-08 01:11:15,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:11:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-08 01:11:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-08 01:11:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 01:11:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-08 01:11:15,953 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-09-08 01:11:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-08 01:11:15,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:11:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-08 01:11:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 01:11:15,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:15,954 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:15,954 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 780687374, now seen corresponding path program 72 times [2019-09-08 01:11:15,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:15,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:17,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:17,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:17,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:18,041 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2019-09-08 01:11:18,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:18,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:11:18,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:18,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:11:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:11:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:11:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:11:18,067 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 77 states. [2019-09-08 01:11:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:18,180 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-09-08 01:11:18,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:11:18,180 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 86 [2019-09-08 01:11:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:18,181 INFO L225 Difference]: With dead ends: 96 [2019-09-08 01:11:18,181 INFO L226 Difference]: Without dead ends: 89 [2019-09-08 01:11:18,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:11:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-08 01:11:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-08 01:11:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-08 01:11:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-08 01:11:18,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-09-08 01:11:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:18,185 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-08 01:11:18,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:11:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-08 01:11:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 01:11:18,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:18,186 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:18,186 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash 409623153, now seen corresponding path program 73 times [2019-09-08 01:11:18,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:18,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:18,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:20,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:20,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:20,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:11:20,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:20,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:20,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:11:20,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:11:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:11:20,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:11:20,382 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 78 states. [2019-09-08 01:11:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:20,509 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-09-08 01:11:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:11:20,509 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 87 [2019-09-08 01:11:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:20,510 INFO L225 Difference]: With dead ends: 97 [2019-09-08 01:11:20,510 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 01:11:20,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:11:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 01:11:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-08 01:11:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-08 01:11:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-08 01:11:20,515 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2019-09-08 01:11:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:20,515 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-08 01:11:20,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:11:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-08 01:11:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 01:11:20,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:20,516 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:20,516 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1791534190, now seen corresponding path program 74 times [2019-09-08 01:11:20,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:20,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:20,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:22,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:22,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:22,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:22,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:22,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:11:22,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:22,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:11:22,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:11:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:11:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:11:22,686 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 79 states. [2019-09-08 01:11:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:22,825 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-09-08 01:11:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:11:22,825 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 88 [2019-09-08 01:11:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:22,826 INFO L225 Difference]: With dead ends: 98 [2019-09-08 01:11:22,826 INFO L226 Difference]: Without dead ends: 91 [2019-09-08 01:11:22,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:11:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-08 01:11:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-08 01:11:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 01:11:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-09-08 01:11:22,830 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-09-08 01:11:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:22,830 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-09-08 01:11:22,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:11:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-09-08 01:11:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 01:11:22,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:22,831 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:22,831 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1681103377, now seen corresponding path program 75 times [2019-09-08 01:11:22,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:22,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:22,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:22,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:22,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:24,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:24,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:24,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:25,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 01:11:25,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:25,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:11:25,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:25,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:25,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:11:25,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:11:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:11:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:11:25,077 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 80 states. [2019-09-08 01:11:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:25,206 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-08 01:11:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:11:25,207 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 89 [2019-09-08 01:11:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:25,208 INFO L225 Difference]: With dead ends: 99 [2019-09-08 01:11:25,208 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 01:11:25,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:11:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 01:11:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-08 01:11:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-08 01:11:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-09-08 01:11:25,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 89 [2019-09-08 01:11:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:25,215 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-09-08 01:11:25,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:11:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-09-08 01:11:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 01:11:25,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:25,216 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:25,217 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:25,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1742251826, now seen corresponding path program 76 times [2019-09-08 01:11:25,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:25,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:25,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:25,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:25,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:27,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:27,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:27,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:27,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:27,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:27,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:11:27,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:27,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:27,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:11:27,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:11:27,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:11:27,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:11:27,838 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 81 states. [2019-09-08 01:11:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:27,985 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-08 01:11:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:11:27,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 90 [2019-09-08 01:11:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:27,986 INFO L225 Difference]: With dead ends: 100 [2019-09-08 01:11:27,986 INFO L226 Difference]: Without dead ends: 93 [2019-09-08 01:11:27,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:11:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-08 01:11:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-09-08 01:11:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 01:11:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-09-08 01:11:27,991 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-09-08 01:11:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:27,991 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-09-08 01:11:27,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:11:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-09-08 01:11:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 01:11:27,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:27,992 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:27,992 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash -492080719, now seen corresponding path program 77 times [2019-09-08 01:11:27,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:27,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:30,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:30,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:30,209 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:30,307 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-08 01:11:30,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:30,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:11:30,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:30,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:30,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:11:30,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:11:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:11:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:11:30,334 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 82 states. [2019-09-08 01:11:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:30,455 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-08 01:11:30,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:11:30,456 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 91 [2019-09-08 01:11:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:30,457 INFO L225 Difference]: With dead ends: 101 [2019-09-08 01:11:30,457 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 01:11:30,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:11:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 01:11:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-08 01:11:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-08 01:11:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-08 01:11:30,460 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-09-08 01:11:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:30,461 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-08 01:11:30,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:11:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-08 01:11:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 01:11:30,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:30,462 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:30,462 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -391482066, now seen corresponding path program 78 times [2019-09-08 01:11:30,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:30,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:32,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:32,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:32,818 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:32,920 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-09-08 01:11:32,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:32,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:11:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:32,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:11:32,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:11:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:11:32,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:11:32,946 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 83 states. [2019-09-08 01:11:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:33,065 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-09-08 01:11:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:11:33,065 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 92 [2019-09-08 01:11:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:33,066 INFO L225 Difference]: With dead ends: 102 [2019-09-08 01:11:33,066 INFO L226 Difference]: Without dead ends: 95 [2019-09-08 01:11:33,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:11:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-08 01:11:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-08 01:11:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 01:11:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-08 01:11:33,071 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-09-08 01:11:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:33,071 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-08 01:11:33,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:11:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-08 01:11:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 01:11:33,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:33,073 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:33,073 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:33,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1567891119, now seen corresponding path program 79 times [2019-09-08 01:11:33,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:33,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:35,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:35,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:35,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:35,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:11:35,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:35,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:11:35,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:11:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:11:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:11:35,515 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 84 states. [2019-09-08 01:11:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:35,671 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-09-08 01:11:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:11:35,671 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 93 [2019-09-08 01:11:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:35,672 INFO L225 Difference]: With dead ends: 103 [2019-09-08 01:11:35,672 INFO L226 Difference]: Without dead ends: 96 [2019-09-08 01:11:35,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:11:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-08 01:11:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-08 01:11:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-08 01:11:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-08 01:11:35,676 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-09-08 01:11:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:35,676 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-08 01:11:35,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:11:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-08 01:11:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 01:11:35,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:35,677 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:35,677 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 618133902, now seen corresponding path program 80 times [2019-09-08 01:11:35,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:35,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:38,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:38,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:38,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:38,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:11:38,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:38,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:38,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:11:38,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:11:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:11:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:11:38,412 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 85 states. [2019-09-08 01:11:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:38,571 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-09-08 01:11:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:11:38,571 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 94 [2019-09-08 01:11:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:38,572 INFO L225 Difference]: With dead ends: 104 [2019-09-08 01:11:38,572 INFO L226 Difference]: Without dead ends: 97 [2019-09-08 01:11:38,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:11:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-08 01:11:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-08 01:11:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-08 01:11:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-08 01:11:38,575 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-09-08 01:11:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:38,575 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-08 01:11:38,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:11:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-08 01:11:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 01:11:38,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:38,576 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:38,577 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -334567183, now seen corresponding path program 81 times [2019-09-08 01:11:38,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:38,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:38,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:38,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:38,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:40,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:40,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:41,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-09-08 01:11:41,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:41,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:11:41,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:11:41,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:11:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:11:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:11:41,140 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 86 states. [2019-09-08 01:11:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:41,272 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-09-08 01:11:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:11:41,272 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 95 [2019-09-08 01:11:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:41,273 INFO L225 Difference]: With dead ends: 105 [2019-09-08 01:11:41,273 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 01:11:41,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:11:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 01:11:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-09-08 01:11:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:11:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-09-08 01:11:41,277 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2019-09-08 01:11:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:41,277 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-09-08 01:11:41,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:11:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-09-08 01:11:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 01:11:41,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:41,278 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:41,279 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 196470254, now seen corresponding path program 82 times [2019-09-08 01:11:41,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:41,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:41,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:43,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:43,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:43,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:43,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:43,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:11:43,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (85)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:43,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:43,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:11:43,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:11:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:11:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:11:43,950 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 87 states. [2019-09-08 01:11:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:44,120 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-09-08 01:11:44,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:11:44,121 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 96 [2019-09-08 01:11:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:44,121 INFO L225 Difference]: With dead ends: 106 [2019-09-08 01:11:44,121 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 01:11:44,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:11:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 01:11:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-08 01:11:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 01:11:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-09-08 01:11:44,125 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-09-08 01:11:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:44,125 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-09-08 01:11:44,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:11:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-09-08 01:11:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 01:11:44,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:44,126 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:44,127 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash -521238383, now seen corresponding path program 83 times [2019-09-08 01:11:44,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:44,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:46,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:46,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:46,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-08 01:11:46,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:46,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:11:46,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (86)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-08 01:11:46,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:11:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:11:46,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:11:46,766 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 88 states. [2019-09-08 01:11:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:46,885 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-09-08 01:11:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:11:46,886 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 97 [2019-09-08 01:11:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:46,887 INFO L225 Difference]: With dead ends: 107 [2019-09-08 01:11:46,887 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 01:11:46,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:11:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 01:11:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-08 01:11:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-08 01:11:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-08 01:11:46,892 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 97 [2019-09-08 01:11:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:46,892 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-08 01:11:46,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:11:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-08 01:11:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 01:11:46,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:46,893 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:46,893 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1295369650, now seen corresponding path program 84 times [2019-09-08 01:11:46,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:46,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:46,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:46,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:49,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:49,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:49,582 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2019-09-08 01:11:49,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:49,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:11:49,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:49,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:11:49,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:11:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:11:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:11:49,604 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 89 states. [2019-09-08 01:11:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:49,730 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-09-08 01:11:49,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:11:49,731 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 98 [2019-09-08 01:11:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:49,732 INFO L225 Difference]: With dead ends: 108 [2019-09-08 01:11:49,732 INFO L226 Difference]: Without dead ends: 101 [2019-09-08 01:11:49,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:11:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-08 01:11:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-09-08 01:11:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 01:11:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-09-08 01:11:49,736 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-09-08 01:11:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:49,736 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-09-08 01:11:49,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:11:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-09-08 01:11:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 01:11:49,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:49,737 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:49,737 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 476364849, now seen corresponding path program 85 times [2019-09-08 01:11:49,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:49,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:52,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:52,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:52,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:11:52,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:11:52,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:11:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:11:52,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:11:52,447 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 90 states. [2019-09-08 01:11:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:52,586 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-08 01:11:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:11:52,586 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 99 [2019-09-08 01:11:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:52,587 INFO L225 Difference]: With dead ends: 109 [2019-09-08 01:11:52,587 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:11:52,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:11:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:11:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-08 01:11:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-08 01:11:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-08 01:11:52,592 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-08 01:11:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:52,592 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-08 01:11:52,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:11:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-08 01:11:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 01:11:52,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:52,593 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:52,593 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash -434440530, now seen corresponding path program 86 times [2019-09-08 01:11:52,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:55,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:55,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:55,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:55,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:55,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:55,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:11:55,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:55,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:55,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:11:55,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:11:55,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:11:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:11:55,519 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 91 states. [2019-09-08 01:11:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:55,680 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-09-08 01:11:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:11:55,681 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 100 [2019-09-08 01:11:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:55,681 INFO L225 Difference]: With dead ends: 110 [2019-09-08 01:11:55,681 INFO L226 Difference]: Without dead ends: 103 [2019-09-08 01:11:55,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:11:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-08 01:11:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-08 01:11:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:11:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-08 01:11:55,685 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-09-08 01:11:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:55,685 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-08 01:11:55,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:11:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-08 01:11:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 01:11:55,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:55,686 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:55,686 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1395363793, now seen corresponding path program 87 times [2019-09-08 01:11:55,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:58,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:58,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:58,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 01:11:58,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:58,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:11:58,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:58,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:11:58,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:11:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:11:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:11:58,599 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 92 states. [2019-09-08 01:11:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:58,784 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-09-08 01:11:58,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:11:58,788 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 101 [2019-09-08 01:11:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:58,789 INFO L225 Difference]: With dead ends: 111 [2019-09-08 01:11:58,789 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 01:11:58,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 102 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 01:11:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 01:11:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-08 01:11:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 01:11:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-08 01:11:58,793 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-09-08 01:11:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:58,794 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-08 01:11:58,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:11:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-08 01:11:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 01:11:58,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:58,795 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:58,795 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2010244338, now seen corresponding path program 88 times [2019-09-08 01:11:58,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:01,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:01,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:01,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:01,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:01,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:01,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:12:01,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:01,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:12:01,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:12:01,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:12:01,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:12:01,727 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 93 states. [2019-09-08 01:12:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:01,853 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-09-08 01:12:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:12:01,853 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 102 [2019-09-08 01:12:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:01,854 INFO L225 Difference]: With dead ends: 112 [2019-09-08 01:12:01,854 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 01:12:01,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:12:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 01:12:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-08 01:12:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-08 01:12:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-08 01:12:01,859 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-09-08 01:12:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:01,859 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-08 01:12:01,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:12:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-08 01:12:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 01:12:01,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:01,860 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:01,860 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -209913999, now seen corresponding path program 89 times [2019-09-08 01:12:01,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:04,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:04,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:04,852 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-09-08 01:12:04,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:04,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:12:04,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:12:04,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:12:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:12:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:12:04,877 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 94 states. [2019-09-08 01:12:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:05,013 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2019-09-08 01:12:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:12:05,013 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 103 [2019-09-08 01:12:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:05,014 INFO L225 Difference]: With dead ends: 113 [2019-09-08 01:12:05,015 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 01:12:05,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:12:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 01:12:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-09-08 01:12:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-08 01:12:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-08 01:12:05,019 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 103 [2019-09-08 01:12:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:05,020 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-08 01:12:05,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:12:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-08 01:12:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 01:12:05,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:05,021 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:05,021 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash -234248338, now seen corresponding path program 90 times [2019-09-08 01:12:05,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:05,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:08,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:08,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:08,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:08,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-09-08 01:12:08,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:08,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:12:08,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:08,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:08,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:12:08,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:12:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:12:08,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:12:08,402 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 95 states. [2019-09-08 01:12:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:08,599 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-09-08 01:12:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:12:08,600 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 104 [2019-09-08 01:12:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:08,600 INFO L225 Difference]: With dead ends: 114 [2019-09-08 01:12:08,600 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 01:12:08,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:12:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 01:12:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-08 01:12:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 01:12:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-09-08 01:12:08,605 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-09-08 01:12:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:08,605 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-09-08 01:12:08,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:12:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-09-08 01:12:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 01:12:08,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:08,606 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:08,606 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -988612847, now seen corresponding path program 91 times [2019-09-08 01:12:08,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:08,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:11,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:11,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:11,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:11,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:12:11,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:11,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:11,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:12:11,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:12:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:12:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:12:11,749 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 96 states. [2019-09-08 01:12:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:11,889 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-09-08 01:12:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:12:11,890 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 105 [2019-09-08 01:12:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:11,891 INFO L225 Difference]: With dead ends: 115 [2019-09-08 01:12:11,891 INFO L226 Difference]: Without dead ends: 108 [2019-09-08 01:12:11,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 106 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 01:12:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-08 01:12:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-08 01:12:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-08 01:12:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-09-08 01:12:11,894 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2019-09-08 01:12:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:11,894 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-09-08 01:12:11,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:12:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-09-08 01:12:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 01:12:11,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:11,895 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:11,896 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1395891150, now seen corresponding path program 92 times [2019-09-08 01:12:11,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:11,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:14,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:14,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:14,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:15,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:15,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:15,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:12:15,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:12:15,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:12:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:12:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:12:15,038 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 97 states. [2019-09-08 01:12:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:15,240 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-09-08 01:12:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:12:15,240 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 106 [2019-09-08 01:12:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:15,241 INFO L225 Difference]: With dead ends: 116 [2019-09-08 01:12:15,241 INFO L226 Difference]: Without dead ends: 109 [2019-09-08 01:12:15,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:12:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-08 01:12:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-09-08 01:12:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-08 01:12:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-09-08 01:12:15,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-09-08 01:12:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:15,244 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-09-08 01:12:15,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:12:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-09-08 01:12:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 01:12:15,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:15,246 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:15,246 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1993896271, now seen corresponding path program 93 times [2019-09-08 01:12:15,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:15,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:18,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:18,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:18,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-09-08 01:12:18,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:18,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:12:18,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (96)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:12:18,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:18,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:12:18,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:12:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:12:18,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:12:18,501 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 98 states. [2019-09-08 01:12:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:18,631 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-08 01:12:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:12:18,631 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 107 [2019-09-08 01:12:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:18,632 INFO L225 Difference]: With dead ends: 117 [2019-09-08 01:12:18,632 INFO L226 Difference]: Without dead ends: 110 [2019-09-08 01:12:18,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:12:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-08 01:12:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-08 01:12:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 01:12:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-08 01:12:18,636 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2019-09-08 01:12:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:18,636 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-08 01:12:18,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:12:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-08 01:12:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 01:12:18,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:18,637 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:18,637 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 296876078, now seen corresponding path program 94 times [2019-09-08 01:12:18,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:18,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:21,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:21,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:21,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:21,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:21,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:12:21,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (97)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:12:21,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:21,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:12:21,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:12:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:12:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:12:21,916 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 99 states. [2019-09-08 01:12:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:22,064 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-09-08 01:12:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:12:22,065 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 108 [2019-09-08 01:12:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:22,066 INFO L225 Difference]: With dead ends: 118 [2019-09-08 01:12:22,066 INFO L226 Difference]: Without dead ends: 111 [2019-09-08 01:12:22,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:12:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-08 01:12:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-08 01:12:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 01:12:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-08 01:12:22,070 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-09-08 01:12:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:22,070 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-08 01:12:22,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:12:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-08 01:12:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 01:12:22,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:22,071 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:22,071 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1703625135, now seen corresponding path program 95 times [2019-09-08 01:12:22,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:22,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:25,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:25,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:25,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-08 01:12:25,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:25,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:12:25,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:25,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:25,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:12:25,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:12:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:12:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:12:25,487 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 100 states. [2019-09-08 01:12:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:25,700 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-09-08 01:12:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:12:25,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 109 [2019-09-08 01:12:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:25,701 INFO L225 Difference]: With dead ends: 119 [2019-09-08 01:12:25,701 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 01:12:25,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:12:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 01:12:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-08 01:12:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-08 01:12:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-08 01:12:25,708 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-08 01:12:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:25,708 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-08 01:12:25,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:12:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-08 01:12:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 01:12:25,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:25,709 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:25,709 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 705346702, now seen corresponding path program 96 times [2019-09-08 01:12:25,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:25,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:25,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:25,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:25,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:29,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:29,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:29,189 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2019-09-08 01:12:29,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:29,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:12:29,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:29,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:29,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:12:29,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:12:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:12:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:12:29,213 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 101 states. [2019-09-08 01:12:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:29,404 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-09-08 01:12:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:12:29,405 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 110 [2019-09-08 01:12:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:29,406 INFO L225 Difference]: With dead ends: 120 [2019-09-08 01:12:29,406 INFO L226 Difference]: Without dead ends: 113 [2019-09-08 01:12:29,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:12:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-08 01:12:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-08 01:12:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 01:12:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-09-08 01:12:29,409 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-09-08 01:12:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:29,409 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-09-08 01:12:29,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:12:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-09-08 01:12:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 01:12:29,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:29,410 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:29,410 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1925937679, now seen corresponding path program 97 times [2019-09-08 01:12:29,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:29,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:32,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:32,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:32,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:32,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:12:32,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:32,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:12:32,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:12:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:12:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:12:32,911 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 102 states. [2019-09-08 01:12:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:33,063 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-09-08 01:12:33,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:12:33,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 111 [2019-09-08 01:12:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:33,064 INFO L225 Difference]: With dead ends: 121 [2019-09-08 01:12:33,064 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 01:12:33,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 112 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 01:12:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 01:12:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-08 01:12:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 01:12:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-08 01:12:33,070 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-09-08 01:12:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:33,070 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-08 01:12:33,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:12:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-08 01:12:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 01:12:33,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:33,071 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:33,071 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1891374866, now seen corresponding path program 98 times [2019-09-08 01:12:33,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:33,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:12:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:12:33,179 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:12:33,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:12:33 BoogieIcfgContainer [2019-09-08 01:12:33,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:12:33,323 INFO L168 Benchmark]: Toolchain (without parser) took 147014.78 ms. Allocated memory was 134.7 MB in the beginning and 777.5 MB in the end (delta: 642.8 MB). Free memory was 89.1 MB in the beginning and 139.1 MB in the end (delta: -50.0 MB). Peak memory consumption was 592.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,324 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.32 ms. Allocated memory is still 134.7 MB. Free memory was 88.9 MB in the beginning and 79.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,324 INFO L168 Benchmark]: Boogie Preprocessor took 136.18 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 79.6 MB in the beginning and 178.4 MB in the end (delta: -98.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,325 INFO L168 Benchmark]: RCFGBuilder took 237.26 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 166.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,325 INFO L168 Benchmark]: TraceAbstraction took 146363.85 ms. Allocated memory was 201.3 MB in the beginning and 777.5 MB in the end (delta: 576.2 MB). Free memory was 166.3 MB in the beginning and 139.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 603.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:33,327 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.32 ms. Allocated memory is still 134.7 MB. Free memory was 88.9 MB in the beginning and 79.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.18 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 79.6 MB in the beginning and 178.4 MB in the end (delta: -98.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 237.26 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 166.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146363.85 ms. Allocated memory was 201.3 MB in the beginning and 777.5 MB in the end (delta: 576.2 MB). Free memory was 166.3 MB in the beginning and 139.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 603.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 39]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 26, overapproximation of someBinaryArithmeticDOUBLEoperation at line 17. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=42, __return_main=0] [L7] double main__x0; [L8] double main__x1; [L9] double main__x2; [L10] int main__i; [L11] main__x0 = 5.5 [L12] main__x1 = 5.545454545454546 [L13] main__i = 0 VAL [__return_main=0, main__i=0, main__x0=11/2, main__x1=2772727272727273/500000000000000] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x0=2772727272727273/500000000000000, main__x1=7, main__x2=7] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x0=7, main__x1=5, main__x2=5] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x0=5, main__x1=4, main__x2=4] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x0=4, main__x1=6, main__x2=6] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x0=6, main__x1=65, main__x2=65] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x0=65, main__x1=63, main__x2=63] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x0=63, main__x1=72, main__x2=72] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x0=72, main__x1=71, main__x2=71] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x0=71, main__x1=70, main__x2=70] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x0=70, main__x1=69, main__x2=69] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x0=69, main__x1=62, main__x2=62] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x0=62, main__x1=61, main__x2=61] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x0=61, main__x1=60, main__x2=60] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x0=60, main__x1=59, main__x2=59] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x0=59, main__x1=54, main__x2=54] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x0=54, main__x1=53, main__x2=53] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x0=53, main__x1=52, main__x2=52] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x0=52, main__x1=58, main__x2=58] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x0=58, main__x1=57, main__x2=57] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x0=57, main__x1=56, main__x2=56] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x0=56, main__x1=55, main__x2=55] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x0=55, main__x1=51, main__x2=51] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x0=51, main__x1=50, main__x2=50] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x0=50, main__x1=49, main__x2=49] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x0=49, main__x1=96, main__x2=96] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x0=96, main__x1=95, main__x2=95] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x0=95, main__x1=94, main__x2=94] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x0=94, main__x1=93, main__x2=93] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x0=93, main__x1=100, main__x2=100] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x0=100, main__x1=99, main__x2=99] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x0=99, main__x1=98, main__x2=98] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x0=98, main__x1=97, main__x2=97] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x0=97, main__x1=92, main__x2=92] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x0=92, main__x1=91, main__x2=91] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x0=91, main__x1=90, main__x2=90] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x0=90, main__x1=85, main__x2=85] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x0=85, main__x1=84, main__x2=84] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x0=84, main__x1=82, main__x2=82] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x0=82, main__x1=80, main__x2=80] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x0=80, main__x1=89, main__x2=89] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x0=89, main__x1=88, main__x2=88] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x0=88, main__x1=87, main__x2=87] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x0=87, main__x1=86, main__x2=86] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x0=86, main__x1=79, main__x2=79] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x0=79, main__x1=75, main__x2=75] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x0=75, main__x1=73, main__x2=73] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x0=73, main__x1=21, main__x2=21] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x0=21, main__x1=20, main__x2=20] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x0=20, main__x1=19, main__x2=19] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x0=19, main__x1=18, main__x2=18] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x0=18, main__x1=25, main__x2=25] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x0=25, main__x1=24, main__x2=24] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x0=24, main__x1=23, main__x2=23] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x0=23, main__x1=22, main__x2=22] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x0=22, main__x1=17, main__x2=17] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x0=17, main__x1=16, main__x2=16] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x0=16, main__x1=15, main__x2=15] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x0=15, main__x1=11, main__x2=11] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x0=11, main__x1=10, main__x2=10] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x0=10, main__x1=9, main__x2=9] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x0=9, main__x1=8, main__x2=8] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x0=8, main__x1=14, main__x2=14] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x0=14, main__x1=13, main__x2=13] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x0=13, main__x1=12, main__x2=12] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x0=12, main__x1=3, main__x2=3] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x0=3, main__x1=2, main__x2=2] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x0=2, main__x1=1, main__x2=1] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x0=1, main__x1=0, main__x2=0] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x0=0, main__x1=46, main__x2=46] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x0=46, main__x1=45, main__x2=45] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x0=45, main__x1=44, main__x2=44] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x0=44, main__x1=43, main__x2=43] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x0=43, main__x1=48, main__x2=48] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x0=48, main__x1=47, main__x2=47] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x0=47, main__x1=37, main__x2=37] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x0=37, main__x1=41, main__x2=41] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x0=41, main__x1=40, main__x2=40] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x0=40, main__x1=39, main__x2=39] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x0=39, main__x1=38, main__x2=38] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x0=38, main__x1=35, main__x2=35] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x0=35, main__x1=34, main__x2=34] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x0=34, main__x1=33, main__x2=33] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x0=33, main__x1=32, main__x2=32] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x0=32, main__x1=36, main__x2=36] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x0=36, main__x1=27, main__x2=27] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x0=27, main__x1=26, main__x2=26] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x0=26, main__x1=31, main__x2=31] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x0=31, main__x1=30, main__x2=30] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x0=30, main__x1=29, main__x2=29] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x0=29, main__x1=28, main__x2=28] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x0=28, main__x1=68, main__x2=68] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x0=68, main__x1=67, main__x2=67] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x0=67, main__x1=66, main__x2=66] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x0=66, main__x1=64, main__x2=64] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x0=64, main__x1=83, main__x2=83] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x0=83, main__x1=81, main__x2=81] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x0=81, main__x1=78, main__x2=78] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x0=78, main__x1=77, main__x2=77] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x0=77, main__x1=76, main__x2=76] [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L15] COND FALSE !(main__i < 100) [L25] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L26] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L51] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L33] int __tmp_1; [L34] __tmp_1 = main____CPAchecker_TMP_0 [L35] int __VERIFIER_assert__cond; [L36] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L37] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] [L39] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=76, main__x1=74, main__x2=74] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. UNSAFE Result, 146.2s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1406 SDtfs, 1 SDslu, 40759 SDs, 0 SdLazy, 8555 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11290 GetRequests, 6237 SyntacticMatches, 0 SemanticMatches, 5053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 122.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=100, 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, 100 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 126.5s InterpolantComputationTime, 12400 NumberOfCodeBlocks, 12398 NumberOfCodeBlocksAsserted, 1488 NumberOfCheckSat, 12089 ConstructedInterpolants, 0 QuantifiedInterpolants, 2453931 SizeOfPredicates, 101 NumberOfNonLiveVariables, 37707 ConjunctsInSsa, 5148 ConjunctsInUnsatCore, 199 InterpolantComputations, 2 PerfectInterpolantSequences, 3/333300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...