java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bor3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:30,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:30,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:30,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:30,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:30,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:30,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:30,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:30,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:30,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:30,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:30,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:30,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:30,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:30,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:30,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:30,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:30,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:30,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:30,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:30,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:30,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:30,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:30,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:30,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:30,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:30,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:30,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:30,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:30,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:30,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:30,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:30,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:30,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:30,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:30,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:30,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:30,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:30,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:30,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:30,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:30,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 21:46:30,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:30,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:30,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:30,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:30,360 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:30,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:30,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:30,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:30,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:30,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:30,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:30,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:30,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:30,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:30,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:30,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:30,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:30,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:30,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:30,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:30,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:30,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:30,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:30,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:30,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:30,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:30,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:30,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:30,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:30,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:30,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:30,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:30,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:30,411 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:30,411 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor3.i [2019-10-01 21:46:30,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49caa171/244434c5d6f94bf7bfd6c9e10dd19229/FLAG795f66613 [2019-10-01 21:46:30,920 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:30,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor3.i [2019-10-01 21:46:30,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49caa171/244434c5d6f94bf7bfd6c9e10dd19229/FLAG795f66613 [2019-10-01 21:46:31,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49caa171/244434c5d6f94bf7bfd6c9e10dd19229 [2019-10-01 21:46:31,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:31,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:31,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:31,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:31,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,344 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:31,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:31,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,598 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:31,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,725 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:31,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31 WrapperNode [2019-10-01 21:46:31,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:31,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:31,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:31,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:31,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:31,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2019-10-01 21:46:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:32,118 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:32,118 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:32,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32 BoogieIcfgContainer [2019-10-01 21:46:32,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:32,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:32,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:32,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:32,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:31" (1/3) ... [2019-10-01 21:46:32,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ebcf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (2/3) ... [2019-10-01 21:46:32,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ebcf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32" (3/3) ... [2019-10-01 21:46:32,131 INFO L109 eAbstractionObserver]: Analyzing ICFG bor3.i [2019-10-01 21:46:32,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:32,165 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:32,200 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:32,246 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:32,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:32,247 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:32,247 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:32,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:32,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:32,247 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:32,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:32,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,269 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,271 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 21:46:32,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:32,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,470 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,492 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:32,494 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,504 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:32,504 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:32,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:32,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,552 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:32,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,555 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,556 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 21:46:32,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,647 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,679 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,682 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,682 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:32,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:32,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,691 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:32,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:32,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,693 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,694 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 21:46:32,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 21:46:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:32,778 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:32,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:32,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 21:46:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:32,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,953 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,985 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,987 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,987 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:32,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-10-01 21:46:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:32,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,995 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:32,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:32,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,997 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 21:46:32,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:33,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:33,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,081 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,101 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:33,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,103 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:33,103 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:33,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:33,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,113 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:33,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:33,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,116 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 21:46:33,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,196 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:33,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,299 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,329 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:33,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:33,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,331 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:33,331 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:33,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:33,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,339 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:33,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:33,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,341 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,342 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 21:46:33,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,437 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:33,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:33,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:33,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:33,540 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,577 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:33,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,578 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:33,578 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:33,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:33,585 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,586 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:33,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:33,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,587 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,588 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 21:46:33,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,675 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:33,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 21:46:33,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,766 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,812 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:33,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,814 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:33,814 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:33,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:33,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,822 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:33,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:33,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,823 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,824 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 21:46:33,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:33,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:34,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:34,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:34,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,063 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,122 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:34,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,127 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:34,127 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:34,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:34,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,142 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:34,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:34,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,145 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 21:46:34,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,279 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:34,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:34,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 21:46:34,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:34,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,425 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,506 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,512 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:34,512 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:34,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:34,531 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,531 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:34,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:34,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,533 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,533 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 21:46:34,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 21:46:34,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,651 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:34,727 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:34,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 21:46:34,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:34,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,766 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,818 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,820 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:34,820 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:34,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:34,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,836 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:34,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:34,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,840 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 21:46:34,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:34,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:35,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,116 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,159 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:35,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,161 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:35,161 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:35,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:35,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,168 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:35,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:35,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,169 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,170 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 21:46:35,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:35,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:35,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:35,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:35,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,382 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,431 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,434 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:35,434 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:35,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:35,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,448 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:35,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:35,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,450 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,450 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 21:46:35,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,585 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:35,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:35,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:35,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,703 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,775 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:35,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,777 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:35,778 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:35,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:35,788 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,788 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:35,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:35,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,792 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,792 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 21:46:35,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 21:46:35,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,929 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:36,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:36,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 21:46:36,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:36,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,065 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,151 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:36,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,153 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:36,153 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:36,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:36,159 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,160 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:36,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:36,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,161 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:36,161 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 21:46:36,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 21:46:36,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,296 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:36,506 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:36,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 21:46:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:36,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:36,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,599 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,671 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:36,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,672 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:36,672 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:36,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:36,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,679 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:36,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:36,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,680 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:36,680 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 21:46:36,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 21:46:36,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,829 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:37,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:37,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 21:46:37,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:37,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:37,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:37,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,094 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,189 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:37,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,191 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:37,191 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:37,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:37,197 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,198 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:37,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:37,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,199 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,200 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 21:46:37,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,359 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:37,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:37,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:37,488 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,554 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:37,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,556 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:37,556 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:37,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:37,563 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,564 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:37,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:37,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,566 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,566 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 21:46:37,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,795 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:37,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:37,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:37,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:37,905 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,981 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:37,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,982 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:37,982 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:37,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:37,988 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,989 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:37,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:37,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,990 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,990 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 21:46:37,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,169 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:38,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:38,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 21:46:38,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:38,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,412 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,535 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:38,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,536 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:38,537 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:38,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:38,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,546 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:38,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:38,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,548 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,548 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 21:46:38,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:38,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,795 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:38,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:38,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:38,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:38,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:38,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:38,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:38,939 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,000 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:39,001 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,002 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:39,002 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:39,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:39,008 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,008 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:39,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:39,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,010 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:39,010 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 21:46:39,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,257 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:39,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:39,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 21:46:39,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:39,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:39,908 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,000 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:40,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:40,000 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,001 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:40,001 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:40,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:40,006 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,006 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:40,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:40,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,008 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:40,008 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 21:46:40,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 21:46:40,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,247 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:40,536 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:40,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 269 proven. 16 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-01 21:46:40,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-10-01 21:46:40,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 21:46:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 21:46:40,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2019-10-01 21:46:40,716 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2019-10-01 21:46:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,953 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-10-01 21:46:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 21:46:40,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2019-10-01 21:46:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,956 INFO L225 Difference]: With dead ends: 126 [2019-10-01 21:46:40,956 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:40,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 21:46:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:40,962 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 118 [2019-10-01 21:46:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,962 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:40,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 21:46:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:40,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,964 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:40,964 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 19 times [2019-10-01 21:46:40,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,242 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:41,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:41,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:41,378 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,449 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:41,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,453 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:41,453 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:41,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:41,458 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,458 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:41,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:41,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,460 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,460 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 20 times [2019-10-01 21:46:41,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,764 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:41,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:41,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:41,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 21:46:41,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 21:46:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 21:46:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 21:46:41,921 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2019-10-01 21:46:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,987 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-10-01 21:46:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:41,988 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2019-10-01 21:46:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,989 INFO L225 Difference]: With dead ends: 132 [2019-10-01 21:46:41,989 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 21:46:41,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 21:46:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 21:46:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-10-01 21:46:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 21:46:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-10-01 21:46:41,994 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 126 [2019-10-01 21:46:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,995 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-10-01 21:46:41,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 21:46:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-10-01 21:46:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 21:46:41,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,996 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,996 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -936013345, now seen corresponding path program 21 times [2019-10-01 21:46:41,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:42,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:42,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-10-01 21:46:42,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2019-10-01 21:46:42,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 21:46:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 21:46:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:42,540 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 31 states. [2019-10-01 21:46:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,676 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-10-01 21:46:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 21:46:42,676 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2019-10-01 21:46:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,677 INFO L225 Difference]: With dead ends: 137 [2019-10-01 21:46:42,678 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 21:46:42,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 21:46:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-10-01 21:46:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:42,683 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 128 [2019-10-01 21:46:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,684 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:42,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 21:46:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:42,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,685 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,685 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 22 times [2019-10-01 21:46:42,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,058 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:43,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:43,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:43,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 21:46:43,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:43,252 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 27 states. [2019-10-01 21:46:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,345 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-10-01 21:46:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:43,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 21:46:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,348 INFO L225 Difference]: With dead ends: 140 [2019-10-01 21:46:43,348 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 21:46:43,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 21:46:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-01 21:46:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 21:46:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-10-01 21:46:43,354 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 132 [2019-10-01 21:46:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,355 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-10-01 21:46:43,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-10-01 21:46:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 21:46:43,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,356 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:43,356 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1580020831, now seen corresponding path program 23 times [2019-10-01 21:46:43,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,717 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:46,169 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 21:46:46,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:46,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:46,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-10-01 21:46:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2019-10-01 21:46:46,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:46:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:46:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:46,342 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 35 states. [2019-10-01 21:46:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:46,511 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2019-10-01 21:46:46,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:46:46,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2019-10-01 21:46:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:46,512 INFO L225 Difference]: With dead ends: 145 [2019-10-01 21:46:46,513 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 21:46:46,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 21:46:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-10-01 21:46:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 21:46:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-10-01 21:46:46,518 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 134 [2019-10-01 21:46:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:46,518 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-10-01 21:46:46,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:46:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-10-01 21:46:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 21:46:46,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:46,520 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:46,520 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1175604735, now seen corresponding path program 24 times [2019-10-01 21:46:46,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 21:46:46,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:46,860 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:47,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:47,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:47,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-01 21:46:47,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:46:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:46:47,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:47,784 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 35 states. [2019-10-01 21:46:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,975 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2019-10-01 21:46:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:46:47,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-10-01 21:46:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,979 INFO L225 Difference]: With dead ends: 151 [2019-10-01 21:46:47,979 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 21:46:47,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 21:46:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-10-01 21:46:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:47,985 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 142 [2019-10-01 21:46:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,985 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:47,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:46:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:47,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,986 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,987 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 25 times [2019-10-01 21:46:47,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,532 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:48,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:48,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:48,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:48,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:48,707 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,801 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:48,802 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,803 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:48,803 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:48,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:48,810 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,810 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:48,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:48,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,812 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,812 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 26 times [2019-10-01 21:46:48,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:49,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,348 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:49,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:49,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:49,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 21:46:49,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 21:46:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 21:46:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:49,568 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2019-10-01 21:46:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,659 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2019-10-01 21:46:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:49,659 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2019-10-01 21:46:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,660 INFO L225 Difference]: With dead ends: 156 [2019-10-01 21:46:49,660 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 21:46:49,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 21:46:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-01 21:46:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 21:46:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-10-01 21:46:49,666 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2019-10-01 21:46:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,666 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-10-01 21:46:49,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 21:46:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-10-01 21:46:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 21:46:49,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,667 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:49,668 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1985195099, now seen corresponding path program 27 times [2019-10-01 21:46:49,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:50,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:50,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:50,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:50,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:50,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:50,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2019-10-01 21:46:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2019-10-01 21:46:50,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 21:46:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 21:46:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 21:46:50,623 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2019-10-01 21:46:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:50,787 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-10-01 21:46:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 21:46:50,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2019-10-01 21:46:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:50,788 INFO L225 Difference]: With dead ends: 161 [2019-10-01 21:46:50,789 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 21:46:50,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 21:46:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 21:46:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-10-01 21:46:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-01 21:46:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-10-01 21:46:50,795 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2019-10-01 21:46:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:50,795 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-10-01 21:46:50,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 21:46:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-10-01 21:46:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 21:46:50,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:50,797 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:50,797 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -663803131, now seen corresponding path program 28 times [2019-10-01 21:46:50,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:50,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:51,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:51,377 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:51,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:51,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:51,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:51,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:51,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:51,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-01 21:46:51,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:46:51,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:46:51,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:46:51,749 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2019-10-01 21:46:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:51,895 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-10-01 21:46:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:46:51,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2019-10-01 21:46:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:51,897 INFO L225 Difference]: With dead ends: 167 [2019-10-01 21:46:51,897 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 21:46:51,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:46:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 21:46:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-01 21:46:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 21:46:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-01 21:46:51,911 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2019-10-01 21:46:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:51,912 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-01 21:46:51,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:46:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-01 21:46:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 21:46:51,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:51,913 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:51,913 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1053839515, now seen corresponding path program 29 times [2019-10-01 21:46:51,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:51,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:52,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:52,372 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:53,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 21:46:53,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:46:53,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2019-10-01 21:46:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:54,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-10-01 21:46:54,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:46:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:46:54,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:54,242 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2019-10-01 21:46:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:54,448 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-10-01 21:46:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:46:54,449 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2019-10-01 21:46:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:54,450 INFO L225 Difference]: With dead ends: 173 [2019-10-01 21:46:54,450 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 21:46:54,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 21:46:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-10-01 21:46:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 21:46:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-01 21:46:54,460 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2019-10-01 21:46:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:54,460 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-01 21:46:54,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:46:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-01 21:46:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-01 21:46:54,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:54,462 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:54,462 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 444869061, now seen corresponding path program 30 times [2019-10-01 21:46:54,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:54,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:46:55,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:55,170 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:55,242 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:59,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:46:59,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:59,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:46:59,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-01 21:46:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2019-10-01 21:46:59,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:46:59,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:46:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:59,230 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2019-10-01 21:46:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:59,427 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2019-10-01 21:46:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:46:59,428 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-10-01 21:46:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:59,429 INFO L225 Difference]: With dead ends: 179 [2019-10-01 21:46:59,429 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 21:46:59,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 21:46:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-01 21:46:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:46:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:46:59,435 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2019-10-01 21:46:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:59,435 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:46:59,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:46:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:46:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:46:59,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:59,437 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:59,437 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 31 times [2019-10-01 21:46:59,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:46:59,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:59,951 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:59,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:00,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:47:00,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:47:00,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:47:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:47:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:00,153 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:47:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:00,269 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:47:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:47:00,275 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:47:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:00,276 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:47:00,277 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:47:00,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:47:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:47:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:47:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:47:00,290 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:47:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:00,290 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:47:00,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:47:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:47:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:47:00,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:00,292 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:00,292 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 32 times [2019-10-01 21:47:00,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:00,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:00,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:00,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:00,815 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:00,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:00,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:00,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:00,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 21:47:00,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:00,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 21:47:00,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 21:47:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 21:47:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 21:47:00,990 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2019-10-01 21:47:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:01,103 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-10-01 21:47:01,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 21:47:01,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2019-10-01 21:47:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:01,105 INFO L225 Difference]: With dead ends: 184 [2019-10-01 21:47:01,106 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 21:47:01,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 21:47:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 21:47:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-01 21:47:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 21:47:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-10-01 21:47:01,113 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2019-10-01 21:47:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:01,114 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-10-01 21:47:01,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 21:47:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-10-01 21:47:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 21:47:01,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:01,115 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:01,115 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1799058793, now seen corresponding path program 33 times [2019-10-01 21:47:01,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:01,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:01,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:01,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:01,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:01,893 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:02,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:02,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:02,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:02,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-10-01 21:47:02,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:02,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:02,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:02,511 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2019-10-01 21:47:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:02,733 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2019-10-01 21:47:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:02,739 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2019-10-01 21:47:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:02,741 INFO L225 Difference]: With dead ends: 189 [2019-10-01 21:47:02,741 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 21:47:02,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 21:47:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-01 21:47:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 21:47:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-10-01 21:47:02,747 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2019-10-01 21:47:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:02,749 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-10-01 21:47:02,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-10-01 21:47:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-01 21:47:02,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:02,750 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:02,751 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2144942025, now seen corresponding path program 34 times [2019-10-01 21:47:02,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:02,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:02,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:02,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-01 21:47:03,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:03,332 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:03,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:03,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:03,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:03,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:47:03,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-01 21:47:03,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-01 21:47:03,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:47:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:47:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:03,855 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2019-10-01 21:47:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:04,169 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2019-10-01 21:47:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:47:04,170 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2019-10-01 21:47:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:04,171 INFO L225 Difference]: With dead ends: 195 [2019-10-01 21:47:04,172 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 21:47:04,173 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 21:47:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 21:47:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 21:47:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-01 21:47:04,178 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2019-10-01 21:47:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:04,179 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-01 21:47:04,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:47:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-01 21:47:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-01 21:47:04,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:04,181 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:04,181 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -715034583, now seen corresponding path program 35 times [2019-10-01 21:47:04,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:04,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:04,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:04,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:04,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2019-10-01 21:47:04,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:04,896 INFO L224 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-10-01 21:47:04,948 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:20,163 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 21:47:20,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:20,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:47:20,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2019-10-01 21:47:20,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:20,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-01 21:47:20,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 21:47:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 21:47:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 21:47:20,461 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2019-10-01 21:47:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:20,651 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-10-01 21:47:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 21:47:20,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2019-10-01 21:47:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:20,657 INFO L225 Difference]: With dead ends: 201 [2019-10-01 21:47:20,657 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 21:47:20,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 21:47:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 21:47:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-10-01 21:47:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 21:47:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-10-01 21:47:20,665 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2019-10-01 21:47:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:20,665 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-10-01 21:47:20,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 21:47:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-10-01 21:47:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:47:20,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:20,667 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:20,667 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 965549705, now seen corresponding path program 36 times [2019-10-01 21:47:20,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:20,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:20,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-01 21:47:21,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:21,573 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 21:47:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:30,068 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 21:47:30,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:30,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:30,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2019-10-01 21:47:30,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:30,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2019-10-01 21:47:30,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:47:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:47:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:30,303 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2019-10-01 21:47:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:30,486 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2019-10-01 21:47:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:47:30,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2019-10-01 21:47:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:30,489 INFO L225 Difference]: With dead ends: 207 [2019-10-01 21:47:30,489 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 21:47:30,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 21:47:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-01 21:47:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:47:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:47:30,497 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2019-10-01 21:47:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:30,497 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:47:30,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:47:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:47:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 21:47:30,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:30,499 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:30,499 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2074972183, now seen corresponding path program 37 times [2019-10-01 21:47:30,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:30,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:31,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:31,444 INFO L224 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-10-01 21:47:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:31,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:47:31,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:31,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:31,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:47:31,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:31,655 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:47:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:31,803 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:47:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:47:31,804 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2019-10-01 21:47:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:31,805 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:47:31,805 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:47:31,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:47:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:47:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:47:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:47:31,811 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2019-10-01 21:47:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:31,812 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:47:31,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:47:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 21:47:31,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:31,813 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:31,813 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1913253685, now seen corresponding path program 38 times [2019-10-01 21:47:31,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:31,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:31,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:31,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:32,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:32,554 INFO L224 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-10-01 21:47:32,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:32,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:32,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:32,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 21:47:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:32,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:32,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 21:47:32,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:47:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:47:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:47:32,740 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2019-10-01 21:47:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:32,885 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2019-10-01 21:47:32,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:32,885 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2019-10-01 21:47:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:32,886 INFO L225 Difference]: With dead ends: 212 [2019-10-01 21:47:32,887 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 21:47:32,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:47:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 21:47:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 21:47:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 21:47:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2019-10-01 21:47:32,893 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2019-10-01 21:47:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:32,893 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2019-10-01 21:47:32,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:47:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2019-10-01 21:47:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 21:47:32,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:32,895 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:32,895 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1120599763, now seen corresponding path program 39 times [2019-10-01 21:47:32,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:32,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:32,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:32,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:33,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:33,684 INFO L224 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-10-01 21:47:33,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:34,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 21:47:34,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:34,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:34,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-01 21:47:34,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:34,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 13] total 54 [2019-10-01 21:47:34,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:47:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:47:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:47:34,348 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 54 states. [2019-10-01 21:47:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:34,600 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2019-10-01 21:47:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 21:47:34,605 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2019-10-01 21:47:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:34,607 INFO L225 Difference]: With dead ends: 217 [2019-10-01 21:47:34,607 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 21:47:34,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:47:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 21:47:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-10-01 21:47:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:47:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:47:34,619 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 210 [2019-10-01 21:47:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:34,620 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:47:34,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:47:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:47:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:47:34,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:34,621 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:34,622 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 40 times [2019-10-01 21:47:34,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:34,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:35,517 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:35,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:35,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:35,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 21:47:35,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:35,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:35,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 21:47:35,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 21:47:35,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 21:47:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 21:47:35,746 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 45 states. [2019-10-01 21:47:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:35,856 INFO L93 Difference]: Finished difference Result 220 states and 228 transitions. [2019-10-01 21:47:35,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 21:47:35,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2019-10-01 21:47:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:35,858 INFO L225 Difference]: With dead ends: 220 [2019-10-01 21:47:35,858 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 21:47:35,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 21:47:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 21:47:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-10-01 21:47:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-01 21:47:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-01 21:47:35,864 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 214 [2019-10-01 21:47:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:35,865 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-01 21:47:35,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 21:47:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-01 21:47:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-01 21:47:35,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:35,866 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:35,866 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash -81045905, now seen corresponding path program 41 times [2019-10-01 21:47:35,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:36,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:36,865 INFO L224 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-10-01 21:47:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:48:58,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 21:48:58,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:58,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:48:58,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2598 trivial. 0 not checked. [2019-10-01 21:48:59,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:59,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 21:48:59,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 21:48:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 21:48:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:48:59,053 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 59 states. [2019-10-01 21:48:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:59,299 INFO L93 Difference]: Finished difference Result 225 states and 237 transitions. [2019-10-01 21:48:59,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:48:59,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 216 [2019-10-01 21:48:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:59,302 INFO L225 Difference]: With dead ends: 225 [2019-10-01 21:48:59,302 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 21:48:59,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:48:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 21:48:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-10-01 21:48:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 21:48:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-10-01 21:48:59,308 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 216 [2019-10-01 21:48:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:59,308 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-10-01 21:48:59,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 21:48:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-10-01 21:48:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-01 21:48:59,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:59,310 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:59,310 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2093949135, now seen corresponding path program 42 times [2019-10-01 21:48:59,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:59,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:49:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:00,235 INFO L224 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-10-01 21:49:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:49:02,981 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:49:02,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:02,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:49:02,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-10-01 21:49:03,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:03,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 58 [2019-10-01 21:49:03,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:49:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:49:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:03,406 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 58 states. [2019-10-01 21:49:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:03,692 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2019-10-01 21:49:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:49:03,692 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-10-01 21:49:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:03,694 INFO L225 Difference]: With dead ends: 231 [2019-10-01 21:49:03,694 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 21:49:03,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 21:49:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-10-01 21:49:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:49:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:49:03,702 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 224 [2019-10-01 21:49:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:03,702 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:49:03,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:49:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:49:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:49:03,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:03,704 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:03,704 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 43 times [2019-10-01 21:49:03,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:03,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:04,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:04,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:05,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:49:05,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:05,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:05,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:49:05,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:49:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:49:05,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:05,227 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:49:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:05,376 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:49:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:49:05,376 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:49:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:05,378 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:49:05,378 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:49:05,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:49:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:49:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:49:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:49:05,384 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:49:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:05,385 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:49:05,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:49:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:49:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:49:05,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:05,387 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:05,387 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 44 times [2019-10-01 21:49:05,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:05,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:06,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:06,455 INFO L224 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-10-01 21:49:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:49:06,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:49:06,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:06,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 21:49:06,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:49:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:06,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 21:49:06,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:49:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:49:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:49:06,681 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 49 states. [2019-10-01 21:49:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:06,886 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2019-10-01 21:49:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:49:06,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2019-10-01 21:49:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:06,888 INFO L225 Difference]: With dead ends: 236 [2019-10-01 21:49:06,888 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 21:49:06,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:49:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 21:49:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 21:49:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 21:49:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-01 21:49:06,897 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 230 [2019-10-01 21:49:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:06,898 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-01 21:49:06,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:49:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-01 21:49:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 21:49:06,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:06,900 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:06,900 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash -166176397, now seen corresponding path program 45 times [2019-10-01 21:49:06,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:06,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:07,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:07,801 INFO L224 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-10-01 21:49:07,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:49:08,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:49:08,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:08,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:49:08,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3129 trivial. 0 not checked. [2019-10-01 21:49:08,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:08,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 15] total 62 [2019-10-01 21:49:08,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 21:49:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 21:49:08,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:49:08,755 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 62 states. [2019-10-01 21:49:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:09,055 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2019-10-01 21:49:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 21:49:09,056 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2019-10-01 21:49:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:09,057 INFO L225 Difference]: With dead ends: 241 [2019-10-01 21:49:09,057 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 21:49:09,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:49:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 21:49:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-01 21:49:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:49:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:49:09,064 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 232 [2019-10-01 21:49:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:09,065 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:49:09,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 21:49:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:49:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:49:09,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:09,066 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:09,067 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 46 times [2019-10-01 21:49:09,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:09,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:09,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:10,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:10,215 INFO L224 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-10-01 21:49:10,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:49:10,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:49:10,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:10,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 21:49:10,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:10,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:10,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 21:49:10,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:49:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:49:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:49:10,476 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 21:49:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:10,649 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 21:49:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:49:10,649 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 21:49:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:10,651 INFO L225 Difference]: With dead ends: 244 [2019-10-01 21:49:10,651 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 21:49:10,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:49:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 21:49:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 21:49:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 21:49:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 21:49:10,660 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 21:49:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:10,660 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 21:49:10,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:49:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 21:49:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 21:49:10,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:10,662 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:10,664 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1971004875, now seen corresponding path program 47 times [2019-10-01 21:49:10,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:10,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:12,228 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 21:49:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:51:25,376 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 21:51:25,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:25,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:51:25,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 21:51:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:25,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 21:51:25,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:51:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:51:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:25,896 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 21:51:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:26,179 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 21:51:26,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:51:26,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 21:51:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:26,181 INFO L225 Difference]: With dead ends: 249 [2019-10-01 21:51:26,181 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 21:51:26,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 21:51:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 21:51:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 21:51:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 21:51:26,189 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 21:51:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:26,189 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 21:51:26,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:51:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 21:51:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 21:51:26,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:26,191 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:26,191 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1090633579, now seen corresponding path program 48 times [2019-10-01 21:51:26,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:26,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:26,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:26,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:51:27,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:27,207 INFO L224 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-10-01 21:51:27,283 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:51:35,284 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:51:35,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:35,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:51:35,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:51:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:35,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 16] total 66 [2019-10-01 21:51:35,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:51:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:51:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:35,704 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 66 states. [2019-10-01 21:51:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:36,027 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2019-10-01 21:51:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:51:36,027 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-01 21:51:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:36,028 INFO L225 Difference]: With dead ends: 255 [2019-10-01 21:51:36,028 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 21:51:36,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 21:51:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-01 21:51:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:51:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:51:36,035 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 246 [2019-10-01 21:51:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:36,036 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:51:36,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:51:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:51:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:51:36,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:36,037 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:36,037 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 49 times [2019-10-01 21:51:36,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:36,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:37,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:37,112 INFO L224 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-10-01 21:51:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:37,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:51:37,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:37,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:51:37,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:51:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:51:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:37,365 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:51:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:37,538 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:51:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:51:37,544 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:51:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:37,545 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:51:37,545 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:51:37,546 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:51:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:51:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:51:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:51:37,551 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:51:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:37,552 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:51:37,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:51:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:51:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:51:37,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:37,553 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:37,554 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 50 times [2019-10-01 21:51:37,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:38,707 INFO L224 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-10-01 21:51:38,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:51:38,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:51:38,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:38,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 21:51:38,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 21:51:38,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:51:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:51:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:51:38,949 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 21:51:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:39,158 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 21:51:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 21:51:39,158 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 21:51:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:39,159 INFO L225 Difference]: With dead ends: 260 [2019-10-01 21:51:39,160 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 21:51:39,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:51:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 21:51:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 21:51:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 21:51:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 21:51:39,166 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 21:51:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:39,166 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 21:51:39,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:51:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 21:51:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 21:51:39,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:39,168 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:39,168 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1386663737, now seen corresponding path program 51 times [2019-10-01 21:51:39,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:39,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:40,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:40,309 INFO L224 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-10-01 21:51:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:51:41,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:51:41,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:41,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:51:41,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 21:51:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 17] total 70 [2019-10-01 21:51:42,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 21:51:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 21:51:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:51:42,378 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 70 states. [2019-10-01 21:51:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:42,643 INFO L93 Difference]: Finished difference Result 265 states and 274 transitions. [2019-10-01 21:51:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 21:51:42,644 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 254 [2019-10-01 21:51:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:42,645 INFO L225 Difference]: With dead ends: 265 [2019-10-01 21:51:42,645 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 21:51:42,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:51:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 21:51:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-10-01 21:51:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:51:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:51:42,653 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 254 [2019-10-01 21:51:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:42,653 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:51:42,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 21:51:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:51:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:51:42,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:42,655 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:42,655 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 52 times [2019-10-01 21:51:42,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:42,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:42,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:43,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:43,847 INFO L224 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-10-01 21:51:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:51:44,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:51:44,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:44,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 21:51:44,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:44,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 21:51:44,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:51:44,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:51:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:51:44,114 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 21:51:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:44,360 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 21:51:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 21:51:44,360 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 21:51:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:44,362 INFO L225 Difference]: With dead ends: 268 [2019-10-01 21:51:44,362 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 21:51:44,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:51:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 21:51:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 21:51:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 21:51:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 21:51:44,369 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 21:51:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:44,369 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 21:51:44,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:51:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 21:51:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 21:51:44,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:44,371 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:44,371 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 838228859, now seen corresponding path program 53 times [2019-10-01 21:51:44,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:44,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:44,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:45,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:45,673 INFO L224 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-10-01 21:51:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:53:57,804 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 21:53:57,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:57,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:53:57,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-01 21:53:58,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:58,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 21:53:58,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 21:53:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 21:53:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:53:58,322 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 21:53:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:58,673 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 21:53:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 21:53:58,673 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 21:53:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:58,674 INFO L225 Difference]: With dead ends: 273 [2019-10-01 21:53:58,674 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 21:53:58,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:53:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 21:53:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 21:53:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 21:53:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 21:53:58,680 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 21:53:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:58,681 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 21:53:58,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 21:53:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 21:53:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 21:53:58,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:58,683 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:53:58,683 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1877138907, now seen corresponding path program 54 times [2019-10-01 21:53:58,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:58,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:53:59,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:59,927 INFO L224 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-10-01 21:54:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:54:55,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:54:55,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:55,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 21:54:55,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 1207 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 21:54:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:56,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 20] total 76 [2019-10-01 21:54:56,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 21:54:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 21:54:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=3778, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 21:54:56,159 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 76 states. [2019-10-01 21:54:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:57,171 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2019-10-01 21:54:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 21:54:57,171 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 268 [2019-10-01 21:54:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:57,172 INFO L225 Difference]: With dead ends: 280 [2019-10-01 21:54:57,173 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:54:57,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2226, Invalid=6146, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 21:54:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:54:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:54:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:54:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:54:57,179 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 268 [2019-10-01 21:54:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:57,180 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:54:57,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 21:54:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:54:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:54:57,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:57,181 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:57,182 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 55 times [2019-10-01 21:54:57,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:57,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:58,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:58,493 INFO L224 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-10-01 21:54:58,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:58,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 21:54:58,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:58,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:58,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 21:54:58,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:54:58,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:54:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:54:58,797 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 21:54:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:58,993 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 21:54:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 21:54:58,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 21:54:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:58,994 INFO L225 Difference]: With dead ends: 284 [2019-10-01 21:54:58,995 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 21:54:58,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:54:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 21:54:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 21:54:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 21:54:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 21:54:59,001 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 21:54:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:59,002 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 21:54:59,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:54:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 21:54:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 21:54:59,003 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:59,004 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:59,004 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1346945663, now seen corresponding path program 56 times [2019-10-01 21:54:59,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:59,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:00,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:00,436 INFO L224 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-10-01 21:55:00,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:55:00,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:55:00,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:00,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 21:55:00,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 21:55:00,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 21:55:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 21:55:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:55:00,717 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 62 states. [2019-10-01 21:55:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:00,884 INFO L93 Difference]: Finished difference Result 286 states and 294 transitions. [2019-10-01 21:55:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 21:55:00,886 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 276 [2019-10-01 21:55:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:00,888 INFO L225 Difference]: With dead ends: 286 [2019-10-01 21:55:00,888 INFO L226 Difference]: Without dead ends: 206 [2019-10-01 21:55:00,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:55:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-01 21:55:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-10-01 21:55:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 21:55:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 21:55:00,895 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 276 [2019-10-01 21:55:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:00,895 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 21:55:00,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 21:55:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 21:55:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 21:55:00,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:00,897 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:00,897 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1740070431, now seen corresponding path program 57 times [2019-10-01 21:55:00,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:00,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:00,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:00,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:02,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:02,340 INFO L224 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-10-01 21:55:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:55:03,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:55:03,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:03,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:55:03,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2019-10-01 21:55:04,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:04,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 19] total 79 [2019-10-01 21:55:04,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 21:55:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 21:55:04,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:55:04,262 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 21:55:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:04,637 INFO L93 Difference]: Finished difference Result 291 states and 303 transitions. [2019-10-01 21:55:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 21:55:04,637 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 278 [2019-10-01 21:55:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:04,639 INFO L225 Difference]: With dead ends: 291 [2019-10-01 21:55:04,639 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 21:55:04,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:55:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 21:55:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 21:55:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 21:55:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 21:55:04,645 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 278 [2019-10-01 21:55:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:04,646 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 21:55:04,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 21:55:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 21:55:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 21:55:04,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:04,648 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:04,648 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -948377023, now seen corresponding path program 58 times [2019-10-01 21:55:04,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:04,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:04,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:04,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:04,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:55:06,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:06,163 INFO L224 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-10-01 21:55:06,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:55:06,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:55:06,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:06,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:55:06,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 5053 trivial. 0 not checked. [2019-10-01 21:55:06,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:06,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 20] total 81 [2019-10-01 21:55:06,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 21:55:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 21:55:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:55:06,947 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 21:55:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:07,347 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2019-10-01 21:55:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 21:55:07,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 286 [2019-10-01 21:55:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:07,351 INFO L225 Difference]: With dead ends: 297 [2019-10-01 21:55:07,351 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 21:55:07,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:55:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 21:55:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 21:55:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 21:55:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 21:55:07,358 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 286 [2019-10-01 21:55:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:07,359 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 21:55:07,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 21:55:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 21:55:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-01 21:55:07,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:07,361 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:07,361 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 325396641, now seen corresponding path program 59 times [2019-10-01 21:55:07,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:07,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:07,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:55:08,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:08,904 INFO L224 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-10-01 21:55:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:58:22,210 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-10-01 21:58:22,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:22,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:58:22,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2019-10-01 21:58:22,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:22,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 21:58:22,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 21:58:22,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 21:58:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:58:22,929 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 83 states. [2019-10-01 21:58:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:23,396 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2019-10-01 21:58:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 21:58:23,396 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 294 [2019-10-01 21:58:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:23,397 INFO L225 Difference]: With dead ends: 303 [2019-10-01 21:58:23,398 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 21:58:23,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:58:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 21:58:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-10-01 21:58:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-01 21:58:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-01 21:58:23,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 294 [2019-10-01 21:58:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:23,405 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-01 21:58:23,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 21:58:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-01 21:58:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 21:58:23,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:23,408 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:23,408 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1791384833, now seen corresponding path program 60 times [2019-10-01 21:58:23,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:23,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:23,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:58:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:24,975 INFO L224 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-10-01 21:58:25,088 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:58:36,728 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 21:58:36,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:36,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:58:36,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 1530 proven. 256 refuted. 0 times theorem prover too weak. 5692 trivial. 0 not checked. [2019-10-01 21:58:37,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:37,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 19] total 82 [2019-10-01 21:58:37,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 21:58:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 21:58:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:58:37,299 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 82 states. [2019-10-01 21:58:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:37,753 INFO L93 Difference]: Finished difference Result 309 states and 318 transitions. [2019-10-01 21:58:37,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 21:58:37,753 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 302 [2019-10-01 21:58:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:37,755 INFO L225 Difference]: With dead ends: 309 [2019-10-01 21:58:37,755 INFO L226 Difference]: Without dead ends: 223 [2019-10-01 21:58:37,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:58:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-01 21:58:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-10-01 21:58:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 21:58:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 21:58:37,762 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 302 [2019-10-01 21:58:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:37,763 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 21:58:37,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 21:58:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 21:58:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 21:58:37,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:37,765 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:37,765 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 61 times [2019-10-01 21:58:37,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:37,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:39,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:39,455 INFO L224 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-10-01 21:58:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:39,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 21:58:39,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 21:58:39,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 21:58:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 21:58:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:58:39,758 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 21:58:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:40,018 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 21:58:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:58:40,019 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 21:58:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:40,020 INFO L225 Difference]: With dead ends: 312 [2019-10-01 21:58:40,020 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 21:58:40,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:58:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 21:58:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 21:58:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 21:58:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 21:58:40,027 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 21:58:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:40,027 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 21:58:40,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 21:58:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 21:58:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 21:58:40,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:40,029 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:40,030 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -271433917, now seen corresponding path program 62 times [2019-10-01 21:58:40,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:41,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:41,816 INFO L224 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-10-01 21:58:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:58:42,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:58:42,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:42,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 21:58:42,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:42,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:42,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 21:58:42,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 21:58:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 21:58:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:58:42,146 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 21:58:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:42,398 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 21:58:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 21:58:42,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 21:58:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:42,400 INFO L225 Difference]: With dead ends: 314 [2019-10-01 21:58:42,400 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 21:58:42,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:58:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 21:58:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 21:58:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 21:58:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 21:58:42,407 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 21:58:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:42,408 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 21:58:42,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 21:58:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 21:58:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 21:58:42,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:42,410 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:42,410 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1792272731, now seen corresponding path program 63 times [2019-10-01 21:58:42,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:42,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:44,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:44,083 INFO L224 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) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:58:44,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:58:46,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 21:58:46,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:46,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:58:46,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6073 trivial. 0 not checked. [2019-10-01 21:58:47,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 21:58:47,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 21:58:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 21:58:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:58:47,446 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 21:58:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:47,775 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 21:58:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 21:58:47,776 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 21:58:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:47,777 INFO L225 Difference]: With dead ends: 319 [2019-10-01 21:58:47,777 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 21:58:47,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:58:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 21:58:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 21:58:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 21:58:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 21:58:47,784 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 21:58:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:47,785 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 21:58:47,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 21:58:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 21:58:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 21:58:47,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:47,787 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:47,787 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash 809391621, now seen corresponding path program 64 times [2019-10-01 21:58:47,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:47,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:47,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:47,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 21:58:49,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:49,533 INFO L224 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-10-01 21:58:49,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:58:49,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:58:49,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:49,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:58:49,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2019-10-01 21:58:50,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:50,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 21:58:50,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 21:58:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 21:58:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:58:50,492 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 21:58:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:50,922 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 21:58:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 21:58:50,922 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 21:58:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:50,923 INFO L225 Difference]: With dead ends: 325 [2019-10-01 21:58:50,924 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 21:58:50,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:58:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 21:58:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 21:58:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 21:58:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 21:58:50,931 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 21:58:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:50,931 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 21:58:50,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 21:58:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 21:58:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 21:58:50,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:50,934 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:50,934 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -564254619, now seen corresponding path program 65 times [2019-10-01 21:58:50,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:50,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:50,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8548 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 21:58:52,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:52,694 INFO L224 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-10-01 21:58:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1