java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init6_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:11:52,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:11:52,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:11:52,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:11:52,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:11:52,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:11:52,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:11:52,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:11:52,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:11:52,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:11:52,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:11:52,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:11:52,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:11:52,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:11:52,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:11:52,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:11:52,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:11:52,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:11:52,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:11:52,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:11:52,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:11:52,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:11:52,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:11:52,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:11:52,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:11:52,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:11:52,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:11:52,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:11:52,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:11:52,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:11:52,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:11:52,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:11:52,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:11:52,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:11:52,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:11:52,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:11:52,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:11:52,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:11:52,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:11:52,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:11:52,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:11:52,360 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 23:11:52,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:11:52,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:11:52,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:11:52,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:11:52,385 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:11:52,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:11:52,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:11:52,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:11:52,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:11:52,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:11:52,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:11:52,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:11:52,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:11:52,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:11:52,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:11:52,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:11:52,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:11:52,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:11:52,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:11:52,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:11:52,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:11:52,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:11:52,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:11:52,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:11:52,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:11:52,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:11:52,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:11:52,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:11:52,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:11:52,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:11:52,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:11:52,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:11:52,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:11:52,474 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:11:52,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init6_ground-1.i [2019-10-01 23:11:52,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedafb862/f9797fddaabc40b8a8091af0bd902bfd/FLAG1d747f08d [2019-10-01 23:11:52,999 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:11:53,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init6_ground-1.i [2019-10-01 23:11:53,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedafb862/f9797fddaabc40b8a8091af0bd902bfd/FLAG1d747f08d [2019-10-01 23:11:53,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedafb862/f9797fddaabc40b8a8091af0bd902bfd [2019-10-01 23:11:53,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:11:53,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:11:53,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:11:53,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:11:53,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:11:53,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36edca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53, skipping insertion in model container [2019-10-01 23:11:53,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,434 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:11:53,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:11:53,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:11:53,618 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:11:53,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:11:53,749 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:11:53,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53 WrapperNode [2019-10-01 23:11:53,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:11:53,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:11:53,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:11:53,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:11:53,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (1/1) ... [2019-10-01 23:11:53,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:11:53,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:11:53,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:11:53,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:11:53,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (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 23:11:53,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:11:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:11:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:11:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:11:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:11:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:11:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:11:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:11:54,171 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:11:54,171 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-01 23:11:54,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:11:54 BoogieIcfgContainer [2019-10-01 23:11:54,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:11:54,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:11:54,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:11:54,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:11:54,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:11:53" (1/3) ... [2019-10-01 23:11:54,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d97aad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:11:54, skipping insertion in model container [2019-10-01 23:11:54,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:53" (2/3) ... [2019-10-01 23:11:54,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d97aad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:11:54, skipping insertion in model container [2019-10-01 23:11:54,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:11:54" (3/3) ... [2019-10-01 23:11:54,193 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init6_ground-1.i [2019-10-01 23:11:54,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:11:54,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:11:54,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:11:54,277 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:11:54,277 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:11:54,278 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:11:54,278 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:11:54,278 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:11:54,278 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:11:54,278 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:11:54,278 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:11:54,278 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:11:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-01 23:11:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:11:54,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:54,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:54,305 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1058720290, now seen corresponding path program 1 times [2019-10-01 23:11:54,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:54,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:11:54,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:11:54,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:11:54,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:11:54,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:11:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:11:54,470 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-01 23:11:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:54,494 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2019-10-01 23:11:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:11:54,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-01 23:11:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:54,503 INFO L225 Difference]: With dead ends: 59 [2019-10-01 23:11:54,504 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 23:11:54,507 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 23:11:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 23:11:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 23:11:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:11:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-10-01 23:11:54,548 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2019-10-01 23:11:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:54,548 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-01 23:11:54,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:11:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-10-01 23:11:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:11:54,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:54,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:54,551 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1432039210, now seen corresponding path program 1 times [2019-10-01 23:11:54,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:54,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:11:54,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:11:54,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:11:54,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:11:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:11:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:11:54,621 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2019-10-01 23:11:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:54,703 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-10-01 23:11:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:11:54,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-01 23:11:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:54,706 INFO L225 Difference]: With dead ends: 55 [2019-10-01 23:11:54,706 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 23:11:54,707 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 23:11:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 23:11:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-01 23:11:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 23:11:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-01 23:11:54,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2019-10-01 23:11:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:54,718 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-01 23:11:54,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:11:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-01 23:11:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 23:11:54,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:54,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:54,720 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:54,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2002754829, now seen corresponding path program 1 times [2019-10-01 23:11:54,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:54,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:54,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:11:54,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:54,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 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 23:11:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:11:54,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:11:54,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:11:54,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:11:54,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:11:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:11:54,986 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2019-10-01 23:11:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:55,082 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-10-01 23:11:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:11:55,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-01 23:11:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:55,086 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:11:55,086 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:11:55,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 23:11:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:11:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 23:11:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 23:11:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-01 23:11:55,097 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 29 [2019-10-01 23:11:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:55,097 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-01 23:11:55,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:11:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-01 23:11:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 23:11:55,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:55,099 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:55,099 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1979990410, now seen corresponding path program 2 times [2019-10-01 23:11:55,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:11:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:55,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 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 23:11:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:11:55,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:11:55,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:55,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:11:55,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:11:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:11:55,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:11:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:11:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:11:55,311 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 6 states. [2019-10-01 23:11:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:55,412 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-10-01 23:11:55,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:11:55,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-10-01 23:11:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:55,414 INFO L225 Difference]: With dead ends: 77 [2019-10-01 23:11:55,414 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 23:11:55,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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 23:11:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 23:11:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 23:11:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:11:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-01 23:11:55,424 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2019-10-01 23:11:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:55,424 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-01 23:11:55,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:11:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-01 23:11:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 23:11:55,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:55,426 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] [2019-10-01 23:11:55,427 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 682352339, now seen corresponding path program 3 times [2019-10-01 23:11:55,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-01 23:11:55,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:55,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:11:55,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:55,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:11:55,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:55,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:11:55,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-01 23:11:55,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:11:55,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:11:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:11:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:11:55,707 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 7 states. [2019-10-01 23:11:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:55,820 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-10-01 23:11:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:11:55,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-01 23:11:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:55,821 INFO L225 Difference]: With dead ends: 88 [2019-10-01 23:11:55,821 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 23:11:55,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:11:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 23:11:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-01 23:11:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 23:11:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-10-01 23:11:55,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 41 [2019-10-01 23:11:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:55,831 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-10-01 23:11:55,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:11:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-10-01 23:11:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 23:11:55,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:55,833 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 23:11:55,833 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -411261930, now seen corresponding path program 4 times [2019-10-01 23:11:55,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:55,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 23:11:55,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:55,957 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:11:56,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:11:56,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:56,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:11:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 23:11:56,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:56,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:11:56,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:11:56,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:11:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:11:56,055 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2019-10-01 23:11:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:56,187 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-10-01 23:11:56,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:11:56,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-01 23:11:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:56,188 INFO L225 Difference]: With dead ends: 99 [2019-10-01 23:11:56,188 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 23:11:56,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 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 23:11:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 23:11:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-01 23:11:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:11:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-10-01 23:11:56,197 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 47 [2019-10-01 23:11:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:56,197 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-10-01 23:11:56,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:11:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-10-01 23:11:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 23:11:56,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:56,199 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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 23:11:56,200 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1179573581, now seen corresponding path program 5 times [2019-10-01 23:11:56,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:56,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 23:11:56,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:56,326 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:11:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:58,398 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 23:11:58,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:58,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:11:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 23:11:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:58,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:11:58,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:11:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:11:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:11:58,438 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2019-10-01 23:11:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:58,565 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-10-01 23:11:58,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:11:58,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-01 23:11:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:58,567 INFO L225 Difference]: With dead ends: 110 [2019-10-01 23:11:58,567 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 23:11:58,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:11:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 23:11:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-01 23:11:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 23:11:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-10-01 23:11:58,577 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2019-10-01 23:11:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:58,577 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-10-01 23:11:58,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:11:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-10-01 23:11:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:11:58,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:58,579 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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 23:11:58,579 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1766162870, now seen corresponding path program 6 times [2019-10-01 23:11:58,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:58,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:11:58,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:58,724 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:11:58,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:59,549 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 23:11:59,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:11:59,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:11:59,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:11:59,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:11:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:11:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:11:59,595 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 10 states. [2019-10-01 23:11:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:59,731 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2019-10-01 23:11:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:11:59,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-10-01 23:11:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:59,733 INFO L225 Difference]: With dead ends: 121 [2019-10-01 23:11:59,733 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 23:11:59,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:11:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 23:11:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-01 23:11:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:11:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-10-01 23:11:59,743 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 59 [2019-10-01 23:11:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:59,743 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-10-01 23:11:59,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:11:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-10-01 23:11:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:11:59,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:59,745 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 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 23:11:59,745 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash 728903315, now seen corresponding path program 7 times [2019-10-01 23:11:59,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:59,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:59,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:11:59,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:59,913 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) [2019-10-01 23:11:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:59,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:11:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:12:00,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:00,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:12:00,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:12:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:12:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:12:00,018 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 11 states. [2019-10-01 23:12:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:00,155 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-10-01 23:12:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:12:00,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-01 23:12:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:00,156 INFO L225 Difference]: With dead ends: 132 [2019-10-01 23:12:00,156 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:12:00,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 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 23:12:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:12:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-01 23:12:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 23:12:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-10-01 23:12:00,165 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 65 [2019-10-01 23:12:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:00,166 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-10-01 23:12:00,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:12:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-10-01 23:12:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:12:00,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:00,168 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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 23:12:00,168 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -688629930, now seen corresponding path program 8 times [2019-10-01 23:12:00,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 23:12:00,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:00,352 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 23:12:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:12:00,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:12:00,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:00,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:12:00,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 23:12:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:00,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:12:00,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:12:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:12:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:12:00,480 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 12 states. [2019-10-01 23:12:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:00,642 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2019-10-01 23:12:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:12:00,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-10-01 23:12:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:00,644 INFO L225 Difference]: With dead ends: 143 [2019-10-01 23:12:00,644 INFO L226 Difference]: Without dead ends: 82 [2019-10-01 23:12:00,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 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 23:12:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-01 23:12:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-01 23:12:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 23:12:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-10-01 23:12:00,666 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 71 [2019-10-01 23:12:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:00,667 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-10-01 23:12:00,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:12:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-10-01 23:12:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 23:12:00,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:00,668 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 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 23:12:00,669 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1278280307, now seen corresponding path program 9 times [2019-10-01 23:12:00,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:00,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:00,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-01 23:12:00,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:00,810 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 23:12:00,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:12:13,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:12:13,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:13,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:12:13,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-01 23:12:13,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:12:13,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:12:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:12:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:12:13,731 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 13 states. [2019-10-01 23:12:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:13,862 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2019-10-01 23:12:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:12:13,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-10-01 23:12:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:13,864 INFO L225 Difference]: With dead ends: 154 [2019-10-01 23:12:13,864 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:12:13,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:12:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:12:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-01 23:12:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:12:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2019-10-01 23:12:13,872 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 77 [2019-10-01 23:12:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:13,873 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2019-10-01 23:12:13,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:12:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2019-10-01 23:12:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:12:13,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:13,874 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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 23:12:13,874 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -106486538, now seen corresponding path program 10 times [2019-10-01 23:12:13,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:13,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-01 23:12:14,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:14,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:14,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:12:14,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:12:14,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:12:14,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-01 23:12:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:14,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:12:14,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:12:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:12:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:12:14,134 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 14 states. [2019-10-01 23:12:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:14,323 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2019-10-01 23:12:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:12:14,323 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-10-01 23:12:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:14,324 INFO L225 Difference]: With dead ends: 165 [2019-10-01 23:12:14,325 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 23:12:14,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:12:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 23:12:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-01 23:12:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 23:12:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-10-01 23:12:14,333 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 83 [2019-10-01 23:12:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:14,333 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-10-01 23:12:14,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:12:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-10-01 23:12:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 23:12:14,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:14,335 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 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 23:12:14,335 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash -391143853, now seen corresponding path program 11 times [2019-10-01 23:12:14,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:14,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:12:14,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:14,562 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 23:12:14,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:12:54,145 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:12:54,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:54,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:12:54,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:12:54,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:54,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:12:54,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:12:54,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:12:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:12:54,247 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 15 states. [2019-10-01 23:12:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:54,451 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2019-10-01 23:12:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:12:54,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-10-01 23:12:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:54,453 INFO L225 Difference]: With dead ends: 176 [2019-10-01 23:12:54,453 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 23:12:54,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:12:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 23:12:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-01 23:12:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 23:12:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-10-01 23:12:54,462 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 89 [2019-10-01 23:12:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:54,462 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-10-01 23:12:54,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:12:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-10-01 23:12:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:12:54,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:54,464 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 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 23:12:54,464 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2080107158, now seen corresponding path program 12 times [2019-10-01 23:12:54,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:54,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:54,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-10-01 23:12:54,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:54,650 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 23:12:54,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:13:23,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:13:23,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:23,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:13:23,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-10-01 23:13:23,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:23,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2019-10-01 23:13:23,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:13:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:13:23,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:13:23,868 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 17 states. [2019-10-01 23:13:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:24,128 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2019-10-01 23:13:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:13:24,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2019-10-01 23:13:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:24,129 INFO L225 Difference]: With dead ends: 187 [2019-10-01 23:13:24,129 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:13:24,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 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 23:13:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:13:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-01 23:13:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:13:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-10-01 23:13:24,140 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2019-10-01 23:13:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:24,140 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-10-01 23:13:24,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:13:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-10-01 23:13:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:13:24,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:24,142 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 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 23:13:24,142 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash -332398029, now seen corresponding path program 13 times [2019-10-01 23:13:24,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:24,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:24,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-10-01 23:13:24,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:24,356 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 23:13:24,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:24,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:13:24,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-10-01 23:13:24,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:24,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:13:24,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:13:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:13:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:13:24,492 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 17 states. [2019-10-01 23:13:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:24,703 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2019-10-01 23:13:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:13:24,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2019-10-01 23:13:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:24,705 INFO L225 Difference]: With dead ends: 198 [2019-10-01 23:13:24,705 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 23:13:24,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 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 23:13:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 23:13:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-01 23:13:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 23:13:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2019-10-01 23:13:24,711 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 101 [2019-10-01 23:13:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:24,712 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2019-10-01 23:13:24,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:13:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2019-10-01 23:13:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 23:13:24,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:24,713 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 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 23:13:24,714 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -904878026, now seen corresponding path program 14 times [2019-10-01 23:13:24,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-01 23:13:24,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:24,894 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 23:13:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:13:24,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:13:25,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:25,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:13:25,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-01 23:13:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:13:25,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:13:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:13:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:13:25,066 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 18 states. [2019-10-01 23:13:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:25,322 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2019-10-01 23:13:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:13:25,322 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2019-10-01 23:13:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:25,324 INFO L225 Difference]: With dead ends: 209 [2019-10-01 23:13:25,324 INFO L226 Difference]: Without dead ends: 118 [2019-10-01 23:13:25,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 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 23:13:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-01 23:13:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-01 23:13:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-01 23:13:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2019-10-01 23:13:25,333 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 107 [2019-10-01 23:13:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:25,335 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2019-10-01 23:13:25,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:13:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2019-10-01 23:13:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 23:13:25,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:25,337 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 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 23:13:25,337 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2139869677, now seen corresponding path program 15 times [2019-10-01 23:13:25,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:25,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 23:13:25,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:25,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:13:25,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:14:09,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:14:09,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:09,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:14:09,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-01 23:14:09,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:09,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2019-10-01 23:14:09,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:14:09,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:14:09,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:14:09,906 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 20 states. [2019-10-01 23:14:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:10,148 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2019-10-01 23:14:10,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:14:10,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-10-01 23:14:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:10,151 INFO L225 Difference]: With dead ends: 220 [2019-10-01 23:14:10,151 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:14:10,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 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 23:14:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:14:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-10-01 23:14:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:14:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2019-10-01 23:14:10,158 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 113 [2019-10-01 23:14:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:10,158 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2019-10-01 23:14:10,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:14:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2019-10-01 23:14:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-01 23:14:10,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:10,160 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 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 23:14:10,160 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash -243049002, now seen corresponding path program 16 times [2019-10-01 23:14:10,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:10,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:10,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-01 23:14:10,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:10,424 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 23:14:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:14:10,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:14:10,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:14:10,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-01 23:14:10,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:10,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:14:10,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:14:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:14:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:14:10,570 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 20 states. [2019-10-01 23:14:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:10,810 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2019-10-01 23:14:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:14:10,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-10-01 23:14:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:10,812 INFO L225 Difference]: With dead ends: 231 [2019-10-01 23:14:10,812 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 23:14:10,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 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 23:14:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 23:14:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-10-01 23:14:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-01 23:14:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-10-01 23:14:10,817 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 119 [2019-10-01 23:14:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:10,818 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-10-01 23:14:10,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:14:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-10-01 23:14:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 23:14:10,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:10,820 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 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 23:14:10,820 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash 767435251, now seen corresponding path program 17 times [2019-10-01 23:14:10,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:10,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-01 23:14:11,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:11,075 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 23:14:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:15:27,848 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 23:15:27,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:27,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:15:27,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-01 23:15:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:27,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:15:27,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:15:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:15:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:15:27,972 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 21 states. [2019-10-01 23:15:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:28,176 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2019-10-01 23:15:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:15:28,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 125 [2019-10-01 23:15:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:28,178 INFO L225 Difference]: With dead ends: 242 [2019-10-01 23:15:28,178 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:15:28,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:15:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:15:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-01 23:15:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 23:15:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2019-10-01 23:15:28,185 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 125 [2019-10-01 23:15:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:28,185 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2019-10-01 23:15:28,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:15:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2019-10-01 23:15:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 23:15:28,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:28,187 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 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 23:15:28,187 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2123232394, now seen corresponding path program 18 times [2019-10-01 23:15:28,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:28,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:28,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:28,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2019-10-01 23:15:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:28,446 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 23:15:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:16:32,357 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:16:32,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:16:32,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:16:32,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:16:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2019-10-01 23:16:32,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:16:32,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:16:32,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:16:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:16:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:16:32,439 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 22 states. [2019-10-01 23:16:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:16:32,705 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2019-10-01 23:16:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:16:32,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 131 [2019-10-01 23:16:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:16:32,707 INFO L225 Difference]: With dead ends: 253 [2019-10-01 23:16:32,707 INFO L226 Difference]: Without dead ends: 142 [2019-10-01 23:16:32,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:16:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-01 23:16:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-01 23:16:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:16:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2019-10-01 23:16:32,715 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 131 [2019-10-01 23:16:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:16:32,716 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2019-10-01 23:16:32,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:16:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2019-10-01 23:16:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:16:32,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:16:32,717 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 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 23:16:32,718 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:16:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:16:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -87040557, now seen corresponding path program 19 times [2019-10-01 23:16:32,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:16:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:16:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:32,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:16:32,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-10-01 23:16:33,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:16:33,107 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 23:16:33,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:16:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:33,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:16:33,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:16:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-10-01 23:16:33,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:16:33,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:16:33,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:16:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:16:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:16:33,269 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 23 states. [2019-10-01 23:16:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:16:33,547 INFO L93 Difference]: Finished difference Result 264 states and 281 transitions. [2019-10-01 23:16:33,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:16:33,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2019-10-01 23:16:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:16:33,549 INFO L225 Difference]: With dead ends: 264 [2019-10-01 23:16:33,549 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 23:16:33,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:16:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 23:16:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-10-01 23:16:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-01 23:16:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2019-10-01 23:16:33,558 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 137 [2019-10-01 23:16:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:16:33,558 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2019-10-01 23:16:33,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:16:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2019-10-01 23:16:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 23:16:33,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:16:33,560 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 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 23:16:33,560 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:16:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:16:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1786425622, now seen corresponding path program 20 times [2019-10-01 23:16:33,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:16:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:16:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:16:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2019-10-01 23:16:33,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:16:33,958 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 23:16:34,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:16:34,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:16:34,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:16:34,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:16:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:16:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:16:34,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:16:34,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:16:34,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:16:34,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:16:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:16:34,218 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 24 states. [2019-10-01 23:16:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:16:34,596 INFO L93 Difference]: Finished difference Result 275 states and 292 transitions. [2019-10-01 23:16:34,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:16:34,601 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2019-10-01 23:16:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:16:34,603 INFO L225 Difference]: With dead ends: 275 [2019-10-01 23:16:34,603 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 23:16:34,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 143 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 23:16:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 23:16:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-10-01 23:16:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-01 23:16:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-10-01 23:16:34,614 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 143 [2019-10-01 23:16:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:16:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-10-01 23:16:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:16:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-10-01 23:16:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-01 23:16:34,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:16:34,617 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 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 23:16:34,617 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:16:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:16:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1930731085, now seen corresponding path program 21 times [2019-10-01 23:16:34,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:16:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:16:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:34,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:16:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-01 23:16:35,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:16:35,082 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 23:16:35,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:17:54,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:17:54,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:17:54,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:17:54,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:17:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-01 23:17:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:17:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:17:54,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:17:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:17:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:17:54,645 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 25 states. [2019-10-01 23:17:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:17:54,930 INFO L93 Difference]: Finished difference Result 286 states and 303 transitions. [2019-10-01 23:17:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:17:54,931 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-10-01 23:17:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:17:54,933 INFO L225 Difference]: With dead ends: 286 [2019-10-01 23:17:54,933 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 23:17:54,934 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 149 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 23:17:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 23:17:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-10-01 23:17:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 23:17:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 166 transitions. [2019-10-01 23:17:54,944 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 166 transitions. Word has length 149 [2019-10-01 23:17:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:17:54,945 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 166 transitions. [2019-10-01 23:17:54,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:17:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2019-10-01 23:17:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 23:17:54,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:17:54,947 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 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 23:17:54,947 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:17:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:17:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash -558149962, now seen corresponding path program 22 times [2019-10-01 23:17:54,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:17:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:17:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:54,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:17:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:17:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-10-01 23:17:55,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:17:55,501 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 23:17:55,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:17:55,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:17:55,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:17:55,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:17:55,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:17:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-10-01 23:17:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:17:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:17:55,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:17:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:17:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:17:55,768 INFO L87 Difference]: Start difference. First operand 160 states and 166 transitions. Second operand 26 states. [2019-10-01 23:17:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:17:56,110 INFO L93 Difference]: Finished difference Result 297 states and 314 transitions. [2019-10-01 23:17:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:17:56,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 155 [2019-10-01 23:17:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:17:56,112 INFO L225 Difference]: With dead ends: 297 [2019-10-01 23:17:56,112 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 23:17:56,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:17:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 23:17:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-10-01 23:17:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:17:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions. [2019-10-01 23:17:56,121 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 155 [2019-10-01 23:17:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:17:56,121 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions. [2019-10-01 23:17:56,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:17:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions. [2019-10-01 23:17:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 23:17:56,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:17:56,122 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 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 23:17:56,123 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:17:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:17:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1204989331, now seen corresponding path program 23 times [2019-10-01 23:17:56,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:17:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:17:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:56,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:17:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:17:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-10-01 23:17:56,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:17:56,661 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 23:17:56,701 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:19:49,367 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 23:19:49,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:19:49,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:19:49,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-10-01 23:19:49,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:49,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:19:49,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:19:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:19:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:19:49,514 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 27 states. [2019-10-01 23:19:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:49,764 INFO L93 Difference]: Finished difference Result 308 states and 325 transitions. [2019-10-01 23:19:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:19:49,765 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 161 [2019-10-01 23:19:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:49,766 INFO L225 Difference]: With dead ends: 308 [2019-10-01 23:19:49,767 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 23:19:49,768 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:19:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 23:19:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-10-01 23:19:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:19:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2019-10-01 23:19:49,775 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 178 transitions. Word has length 161 [2019-10-01 23:19:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:49,775 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 178 transitions. [2019-10-01 23:19:49,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:19:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2019-10-01 23:19:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 23:19:49,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:49,777 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 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 23:19:49,777 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 835839062, now seen corresponding path program 24 times [2019-10-01 23:19:49,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:49,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:19:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2019-10-01 23:19:50,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:50,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 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 23:19:50,477 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:21:35,847 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:21:35,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:35,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:21:35,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 96 proven. 300 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:21:36,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:36,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2019-10-01 23:21:36,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:21:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:21:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:21:36,028 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand 29 states. [2019-10-01 23:21:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:36,381 INFO L93 Difference]: Finished difference Result 319 states and 336 transitions. [2019-10-01 23:21:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:21:36,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 167 [2019-10-01 23:21:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:36,383 INFO L225 Difference]: With dead ends: 319 [2019-10-01 23:21:36,383 INFO L226 Difference]: Without dead ends: 178 [2019-10-01 23:21:36,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:21:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-01 23:21:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-10-01 23:21:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-01 23:21:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2019-10-01 23:21:36,392 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 167 [2019-10-01 23:21:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:36,392 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2019-10-01 23:21:36,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:21:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2019-10-01 23:21:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-01 23:21:36,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:36,393 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 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 23:21:36,394 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1841807731, now seen corresponding path program 25 times [2019-10-01 23:21:36,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:36,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:36,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2019-10-01 23:21:36,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:36,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 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 23:21:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:21:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:37,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:21:37,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2019-10-01 23:21:37,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:37,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:21:37,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:21:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:21:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:21:37,071 INFO L87 Difference]: Start difference. First operand 178 states and 184 transitions. Second operand 29 states. [2019-10-01 23:21:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:37,432 INFO L93 Difference]: Finished difference Result 330 states and 347 transitions. [2019-10-01 23:21:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:21:37,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 173 [2019-10-01 23:21:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:37,434 INFO L225 Difference]: With dead ends: 330 [2019-10-01 23:21:37,434 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:21:37,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:21:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:21:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-10-01 23:21:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 23:21:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 190 transitions. [2019-10-01 23:21:37,442 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 190 transitions. Word has length 173 [2019-10-01 23:21:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:37,442 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 190 transitions. [2019-10-01 23:21:37,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:21:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2019-10-01 23:21:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 23:21:37,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:37,444 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 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 23:21:37,444 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1193512458, now seen corresponding path program 26 times [2019-10-01 23:21:37,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:37,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:21:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-01 23:21:38,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:38,063 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 23:21:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:21:38,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:21:38,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:38,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:21:38,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2019-10-01 23:21:38,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:38,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:21:38,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:21:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:21:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:21:38,257 INFO L87 Difference]: Start difference. First operand 184 states and 190 transitions. Second operand 30 states. [2019-10-01 23:21:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:38,578 INFO L93 Difference]: Finished difference Result 341 states and 358 transitions. [2019-10-01 23:21:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:21:38,578 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 179 [2019-10-01 23:21:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:38,580 INFO L225 Difference]: With dead ends: 341 [2019-10-01 23:21:38,580 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 23:21:38,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 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 23:21:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 23:21:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-10-01 23:21:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-01 23:21:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 196 transitions. [2019-10-01 23:21:38,588 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 196 transitions. Word has length 179 [2019-10-01 23:21:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:38,588 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 196 transitions. [2019-10-01 23:21:38,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:21:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 196 transitions. [2019-10-01 23:21:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 23:21:38,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:38,590 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 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 23:21:38,590 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:38,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1066179923, now seen corresponding path program 27 times [2019-10-01 23:21:38,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:38,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:38,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2019-10-01 23:21:39,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:39,203 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 23:21:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:23:21,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:23:21,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:23:21,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:23:21,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2019-10-01 23:23:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:22,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2019-10-01 23:23:22,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:23:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:23:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:23:22,067 INFO L87 Difference]: Start difference. First operand 190 states and 196 transitions. Second operand 32 states. [2019-10-01 23:23:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:22,482 INFO L93 Difference]: Finished difference Result 352 states and 369 transitions. [2019-10-01 23:23:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:23:22,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 185 [2019-10-01 23:23:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:22,484 INFO L225 Difference]: With dead ends: 352 [2019-10-01 23:23:22,484 INFO L226 Difference]: Without dead ends: 196 [2019-10-01 23:23:22,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:23:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-01 23:23:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-01 23:23:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-01 23:23:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 202 transitions. [2019-10-01 23:23:22,496 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 202 transitions. Word has length 185 [2019-10-01 23:23:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:22,497 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 202 transitions. [2019-10-01 23:23:22,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:23:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 202 transitions. [2019-10-01 23:23:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-01 23:23:22,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:22,499 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 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 23:23:22,499 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1434912874, now seen corresponding path program 28 times [2019-10-01 23:23:22,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:22,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:23:22,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2030 trivial. 0 not checked. [2019-10-01 23:23:23,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:23,048 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 23:23:23,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:23:23,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:23:23,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:23:23,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:23:23,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2030 trivial. 0 not checked. [2019-10-01 23:23:23,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:23,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:23:23,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:23:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:23:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:23:23,291 INFO L87 Difference]: Start difference. First operand 196 states and 202 transitions. Second operand 32 states. [2019-10-01 23:23:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:23,657 INFO L93 Difference]: Finished difference Result 363 states and 380 transitions. [2019-10-01 23:23:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:23:23,657 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 191 [2019-10-01 23:23:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:23,658 INFO L225 Difference]: With dead ends: 363 [2019-10-01 23:23:23,658 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 23:23:23,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:23:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 23:23:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-10-01 23:23:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-01 23:23:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 208 transitions. [2019-10-01 23:23:23,667 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 208 transitions. Word has length 191 [2019-10-01 23:23:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:23,668 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 208 transitions. [2019-10-01 23:23:23,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:23:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 208 transitions. [2019-10-01 23:23:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-01 23:23:23,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:23,669 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 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 23:23:23,670 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 476266803, now seen corresponding path program 29 times [2019-10-01 23:23:23,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:23,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:23:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2175 trivial. 0 not checked. [2019-10-01 23:23:24,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:24,177 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 23:23:24,211 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:25:53,161 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-01 23:25:53,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:53,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:25:53,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2175 trivial. 0 not checked. [2019-10-01 23:25:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:25:53,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:25:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:25:53,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:25:53,343 INFO L87 Difference]: Start difference. First operand 202 states and 208 transitions. Second operand 33 states. [2019-10-01 23:25:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:53,680 INFO L93 Difference]: Finished difference Result 374 states and 391 transitions. [2019-10-01 23:25:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:25:53,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 197 [2019-10-01 23:25:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:53,687 INFO L225 Difference]: With dead ends: 374 [2019-10-01 23:25:53,687 INFO L226 Difference]: Without dead ends: 208 [2019-10-01 23:25:53,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:25:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-01 23:25:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-01 23:25:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-01 23:25:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 214 transitions. [2019-10-01 23:25:53,695 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 214 transitions. Word has length 197 [2019-10-01 23:25:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:53,695 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 214 transitions. [2019-10-01 23:25:53,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:25:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 214 transitions. [2019-10-01 23:25:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-01 23:25:53,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:53,697 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 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 23:25:53,697 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:53,698 INFO L82 PathProgramCache]: Analyzing trace with hash -20613834, now seen corresponding path program 30 times [2019-10-01 23:25:53,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:53,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:53,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:53,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:53,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2019-10-01 23:25:54,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:54,256 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 23:25:54,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE