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-industry-pattern/array_ptr_single_elem_init-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:55:31,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:55:31,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:55:31,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:55:31,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:55:31,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:55:31,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:55:31,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:55:31,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:55:31,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:55:31,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:55:31,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:55:31,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:55:31,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:55:31,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:55:31,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:55:31,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:55:31,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:55:31,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:55:31,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:55:31,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:55:31,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:55:31,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:55:31,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:55:31,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:55:31,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:55:31,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:55:31,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:55:31,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:55:31,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:55:31,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:55:31,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:55:31,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:55:31,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:55:31,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:55:31,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:55:31,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:55:31,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:55:31,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:55:31,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:55:31,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:55:31,370 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:55:31,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:55:31,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:55:31,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:55:31,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:55:31,397 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:55:31,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:55:31,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:55:31,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:55:31,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:55:31,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:55:31,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:55:31,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:55:31,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:55:31,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:55:31,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:55:31,399 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:55:31,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:55:31,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:55:31,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:55:31,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:55:31,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:55:31,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:55:31,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:55:31,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:55:31,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:55:31,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:55:31,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:55:31,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:55:31,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:55:31,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:55:31,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:55:31,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:55:31,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:55:31,455 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:55:31,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-01 23:55:31,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728117b2/540fcdbb4ab3464fb98d43070b1755a5/FLAG7d6d44157 [2019-10-01 23:55:32,034 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:55:32,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-01 23:55:32,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728117b2/540fcdbb4ab3464fb98d43070b1755a5/FLAG7d6d44157 [2019-10-01 23:55:32,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8728117b2/540fcdbb4ab3464fb98d43070b1755a5 [2019-10-01 23:55:32,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:55:32,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:55:32,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:32,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:55:32,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:55:32,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2837cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32, skipping insertion in model container [2019-10-01 23:55:32,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:55:32,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:55:32,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:32,716 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:55:32,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:32,759 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:55:32,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32 WrapperNode [2019-10-01 23:55:32,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:32,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:55:32,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:55:32,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:55:32,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (1/1) ... [2019-10-01 23:55:32,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:55:32,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:55:32,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:55:32,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:55:32,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (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:55:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:55:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:55:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:55:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:55:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:55:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:55:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:55:33,263 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:55:33,264 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-01 23:55:33,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:33 BoogieIcfgContainer [2019-10-01 23:55:33,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:55:33,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:55:33,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:55:33,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:55:33,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:55:32" (1/3) ... [2019-10-01 23:55:33,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9042a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:33, skipping insertion in model container [2019-10-01 23:55:33,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:32" (2/3) ... [2019-10-01 23:55:33,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9042a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:33, skipping insertion in model container [2019-10-01 23:55:33,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:33" (3/3) ... [2019-10-01 23:55:33,273 INFO L109 eAbstractionObserver]: Analyzing ICFG array_ptr_single_elem_init-2.i [2019-10-01 23:55:33,283 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:55:33,291 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:55:33,309 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:55:33,340 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:55:33,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:55:33,341 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:55:33,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:55:33,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:55:33,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:55:33,342 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:55:33,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:55:33,342 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:55:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-01 23:55:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 23:55:33,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:33,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:33,372 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1656037931, now seen corresponding path program 1 times [2019-10-01 23:55:33,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:33,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:33,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:33,518 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:55:33,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:33,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:55:33,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:55:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:55:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:55:33,545 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-01 23:55:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:33,572 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-01 23:55:33,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:55:33,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-01 23:55:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:33,582 INFO L225 Difference]: With dead ends: 46 [2019-10-01 23:55:33,583 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:55:33,587 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:55:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:55:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 23:55:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:55:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-01 23:55:33,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 14 [2019-10-01 23:55:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:33,639 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-01 23:55:33,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:55:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-01 23:55:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 23:55:33,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:33,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:33,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash -533813011, now seen corresponding path program 1 times [2019-10-01 23:55:33,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:33,740 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:55:33,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:33,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:55:33,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:55:33,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:55:33,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:33,743 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2019-10-01 23:55:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:33,857 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-10-01 23:55:33,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:55:33,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-01 23:55:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:33,860 INFO L225 Difference]: With dead ends: 45 [2019-10-01 23:55:33,860 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:55:33,862 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:55:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:55:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-01 23:55:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 23:55:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 23:55:33,877 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2019-10-01 23:55:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:33,879 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 23:55:33,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:55:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 23:55:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 23:55:33,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:33,882 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:33,882 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash -414258795, now seen corresponding path program 1 times [2019-10-01 23:55:33,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:33,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:55:34,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:34,023 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) [2019-10-01 23:55:34,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:55:34,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:55:34,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:34,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:55:34,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:55:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:55:34,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:55:34,149 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 5 states. [2019-10-01 23:55:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:34,255 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-10-01 23:55:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:55:34,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 23:55:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:34,257 INFO L225 Difference]: With dead ends: 56 [2019-10-01 23:55:34,257 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 23:55:34,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:55:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 23:55:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-10-01 23:55:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 23:55:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-10-01 23:55:34,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 22 [2019-10-01 23:55:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:34,274 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-10-01 23:55:34,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:55:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-10-01 23:55:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 23:55:34,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:34,277 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:34,278 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:34,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1579249427, now seen corresponding path program 2 times [2019-10-01 23:55:34,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:34,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:34,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:55:34,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:34,435 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:55:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:34,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:34,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:34,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:55:34,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:55:34,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:55:34,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:55:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:55:34,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:55:34,548 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 6 states. [2019-10-01 23:55:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:34,665 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-10-01 23:55:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:55:34,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-01 23:55:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:34,668 INFO L225 Difference]: With dead ends: 68 [2019-10-01 23:55:34,669 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 23:55:34,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:55:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 23:55:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-10-01 23:55:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 23:55:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-10-01 23:55:34,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 30 [2019-10-01 23:55:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:34,687 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-10-01 23:55:34,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:55:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-10-01 23:55:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:55:34,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:34,691 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:34,691 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1850469483, now seen corresponding path program 3 times [2019-10-01 23:55:34,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:34,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:34,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:34,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:55:34,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:34,841 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:34,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:34,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:55:34,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:34,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:55:34,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:34,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:55:34,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:34,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:34,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:34,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:55:34,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-10-01 23:55:34,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-10-01 23:55:35,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:35,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:55:35,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 [2019-10-01 23:55:35,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:35,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-10-01 23:55:35,144 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:159, output treesize:108 [2019-10-01 23:55:35,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:55:35,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-10-01 23:55:35,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-10-01 23:55:35,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-10-01 23:55:35,302 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:35,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:35,337 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:140, output treesize:3 [2019-10-01 23:55:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:35,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 23:55:35,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:55:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:55:35,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:35,363 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 9 states. [2019-10-01 23:55:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:36,385 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2019-10-01 23:55:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:55:36,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-10-01 23:55:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:36,389 INFO L225 Difference]: With dead ends: 114 [2019-10-01 23:55:36,390 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:55:36,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:55:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2019-10-01 23:55:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 23:55:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-10-01 23:55:36,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2019-10-01 23:55:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:36,403 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-10-01 23:55:36,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:55:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-10-01 23:55:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:55:36,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:36,408 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:36,408 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 304191085, now seen corresponding path program 1 times [2019-10-01 23:55:36,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:36,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:36,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-01 23:55:36,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:36,536 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:55:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:36,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:55:36,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:55:36,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:55:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:55:36,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:55:36,622 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 8 states. [2019-10-01 23:55:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:36,773 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-10-01 23:55:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:55:36,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 23:55:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:36,776 INFO L225 Difference]: With dead ends: 104 [2019-10-01 23:55:36,776 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:55:36,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 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:55:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:55:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2019-10-01 23:55:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 23:55:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2019-10-01 23:55:36,795 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 46 [2019-10-01 23:55:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:36,795 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2019-10-01 23:55:36,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:55:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2019-10-01 23:55:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 23:55:36,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:36,798 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:36,798 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash -828408681, now seen corresponding path program 2 times [2019-10-01 23:55:36,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:36,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:55:36,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:36,912 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:36,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:36,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:36,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:36,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:55:36,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 23:55:36,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:36,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:55:36,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:55:36,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:55:36,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:36,996 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 9 states. [2019-10-01 23:55:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:37,106 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2019-10-01 23:55:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:55:37,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-01 23:55:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:37,109 INFO L225 Difference]: With dead ends: 118 [2019-10-01 23:55:37,110 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 23:55:37,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 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:55:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 23:55:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2019-10-01 23:55:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-01 23:55:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-10-01 23:55:37,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 54 [2019-10-01 23:55:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:37,135 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-10-01 23:55:37,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:55:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-10-01 23:55:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 23:55:37,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:37,140 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:37,140 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash 893310253, now seen corresponding path program 3 times [2019-10-01 23:55:37,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:37,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:37,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:37,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:37,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 23:55:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:37,296 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:37,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:37,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:55:37,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:37,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:55:37,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 23:55:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:37,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:55:37,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:55:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:55:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:55:37,454 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 10 states. [2019-10-01 23:55:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:37,628 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2019-10-01 23:55:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:55:37,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-10-01 23:55:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:37,630 INFO L225 Difference]: With dead ends: 132 [2019-10-01 23:55:37,630 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 23:55:37,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 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:55:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 23:55:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2019-10-01 23:55:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 23:55:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2019-10-01 23:55:37,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 62 [2019-10-01 23:55:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:37,641 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2019-10-01 23:55:37,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:55:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2019-10-01 23:55:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 23:55:37,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:37,643 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:37,643 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -615935017, now seen corresponding path program 4 times [2019-10-01 23:55:37,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:37,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-01 23:55:37,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:37,738 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:37,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:37,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:37,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:37,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:55:37,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:37,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:55:37,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:55:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:55:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:55:37,845 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand 11 states. [2019-10-01 23:55:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:38,008 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2019-10-01 23:55:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:55:38,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-10-01 23:55:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:38,010 INFO L225 Difference]: With dead ends: 146 [2019-10-01 23:55:38,010 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 23:55:38,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 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:55:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 23:55:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-10-01 23:55:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:55:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2019-10-01 23:55:38,020 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 70 [2019-10-01 23:55:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:38,021 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2019-10-01 23:55:38,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:55:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2019-10-01 23:55:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 23:55:38,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:38,023 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:38,023 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1889092589, now seen corresponding path program 5 times [2019-10-01 23:55:38,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:38,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 23:55:38,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:38,140 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:55:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:38,219 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 23:55:38,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:38,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:55:38,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 23:55:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:55:38,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:55:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:55:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:55:38,253 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand 12 states. [2019-10-01 23:55:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:38,452 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2019-10-01 23:55:38,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:55:38,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2019-10-01 23:55:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:38,455 INFO L225 Difference]: With dead ends: 160 [2019-10-01 23:55:38,455 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 23:55:38,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 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:55:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 23:55:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-10-01 23:55:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:55:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2019-10-01 23:55:38,464 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 78 [2019-10-01 23:55:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:38,464 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2019-10-01 23:55:38,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:55:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2019-10-01 23:55:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 23:55:38,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:38,466 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:38,467 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:38,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1861453033, now seen corresponding path program 6 times [2019-10-01 23:55:38,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:38,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:38,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:38,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-01 23:55:38,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:38,588 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:55:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:55:38,703 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:55:38,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:38,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:55:38,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:38,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:38,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:55:38,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:55:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:55:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:55:38,751 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand 13 states. [2019-10-01 23:55:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:38,942 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2019-10-01 23:55:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:55:38,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-10-01 23:55:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:38,944 INFO L225 Difference]: With dead ends: 174 [2019-10-01 23:55:38,944 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:55:38,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 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:55:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:55:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2019-10-01 23:55:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:55:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2019-10-01 23:55:38,953 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 86 [2019-10-01 23:55:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:38,953 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2019-10-01 23:55:38,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:55:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2019-10-01 23:55:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-01 23:55:38,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:38,955 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:38,956 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:38,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1223892307, now seen corresponding path program 7 times [2019-10-01 23:55:38,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-10-01 23:55:39,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:39,085 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:55:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:39,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:55:39,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:55:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:55:39,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:55:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:55:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:55:39,189 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand 14 states. [2019-10-01 23:55:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:39,395 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2019-10-01 23:55:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:55:39,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-10-01 23:55:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:39,397 INFO L225 Difference]: With dead ends: 188 [2019-10-01 23:55:39,397 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:55:39,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 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:55:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:55:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2019-10-01 23:55:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 23:55:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-10-01 23:55:39,404 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 94 [2019-10-01 23:55:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:39,405 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-10-01 23:55:39,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:55:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-10-01 23:55:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 23:55:39,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:39,407 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:39,407 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash -141807017, now seen corresponding path program 8 times [2019-10-01 23:55:39,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:39,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 23:55:39,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:39,575 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:55:39,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:39,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:39,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:39,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:55:39,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-01 23:55:39,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:55:39,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:55:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:55:39,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:55:39,686 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-10-01 23:55:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:39,935 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2019-10-01 23:55:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:55:39,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2019-10-01 23:55:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:39,942 INFO L225 Difference]: With dead ends: 202 [2019-10-01 23:55:39,942 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:55:39,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 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:55:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:55:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2019-10-01 23:55:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-01 23:55:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2019-10-01 23:55:39,949 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 102 [2019-10-01 23:55:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:39,949 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2019-10-01 23:55:39,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:55:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2019-10-01 23:55:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 23:55:39,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:39,951 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:39,951 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989165, now seen corresponding path program 9 times [2019-10-01 23:55:39,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-01 23:55:40,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:40,090 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:55:40,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:40,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:55:40,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:40,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:55:40,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 23:55:40,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:40,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:55:40,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:55:40,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:55:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:55:40,268 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. Second operand 16 states. [2019-10-01 23:55:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:40,478 INFO L93 Difference]: Finished difference Result 216 states and 263 transitions. [2019-10-01 23:55:40,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:55:40,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2019-10-01 23:55:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:40,480 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:55:40,480 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:55:40,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:55:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:55:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2019-10-01 23:55:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 23:55:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2019-10-01 23:55:40,487 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 110 [2019-10-01 23:55:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:40,488 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2019-10-01 23:55:40,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:55:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2019-10-01 23:55:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 23:55:40,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:40,490 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:40,490 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -882067049, now seen corresponding path program 10 times [2019-10-01 23:55:40,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:40,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:40,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-10-01 23:55:40,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:40,672 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) [2019-10-01 23:55:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:40,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:40,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:40,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:55:40,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-01 23:55:40,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:40,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:55:40,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:55:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:55:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:55:40,792 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand 17 states. [2019-10-01 23:55:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:41,045 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2019-10-01 23:55:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:55:41,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 118 [2019-10-01 23:55:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:41,047 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:55:41,047 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 23:55:41,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 118 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:55:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 23:55:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2019-10-01 23:55:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:55:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2019-10-01 23:55:41,054 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 118 [2019-10-01 23:55:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:41,055 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2019-10-01 23:55:41,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:55:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2019-10-01 23:55:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:55:41,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:41,057 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:41,057 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash 128954413, now seen corresponding path program 11 times [2019-10-01 23:55:41,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:41,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-01 23:55:41,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:41,271 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:55:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:41,385 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:55:41,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:41,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:55:41,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-01 23:55:41,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:41,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:55:41,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:55:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:55:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:55:41,424 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand 18 states. [2019-10-01 23:55:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:41,674 INFO L93 Difference]: Finished difference Result 244 states and 297 transitions. [2019-10-01 23:55:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:55:41,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 126 [2019-10-01 23:55:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:41,676 INFO L225 Difference]: With dead ends: 244 [2019-10-01 23:55:41,676 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 23:55:41,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 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:55:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 23:55:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2019-10-01 23:55:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 23:55:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2019-10-01 23:55:41,683 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 126 [2019-10-01 23:55:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:41,683 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2019-10-01 23:55:41,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:55:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2019-10-01 23:55:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 23:55:41,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:41,685 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:41,685 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1101917993, now seen corresponding path program 12 times [2019-10-01 23:55:41,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:41,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:41,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-01 23:55:41,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:41,866 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:55:41,888 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:55:42,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:55:42,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:42,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:55:42,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-01 23:55:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:42,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:55:42,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:55:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:55:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:55:42,184 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 19 states. [2019-10-01 23:55:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:42,484 INFO L93 Difference]: Finished difference Result 258 states and 314 transitions. [2019-10-01 23:55:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:55:42,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 134 [2019-10-01 23:55:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:42,486 INFO L225 Difference]: With dead ends: 258 [2019-10-01 23:55:42,487 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 23:55:42,487 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:55:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 23:55:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-10-01 23:55:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-01 23:55:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 244 transitions. [2019-10-01 23:55:42,494 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 244 transitions. Word has length 134 [2019-10-01 23:55:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:42,494 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 244 transitions. [2019-10-01 23:55:42,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:55:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 244 transitions. [2019-10-01 23:55:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:55:42,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:42,496 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:42,496 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 244768493, now seen corresponding path program 13 times [2019-10-01 23:55:42,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-10-01 23:55:42,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:42,698 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:55:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:42,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:55:42,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:55:42,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:42,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:55:42,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:55:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:55:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:55:42,803 INFO L87 Difference]: Start difference. First operand 194 states and 244 transitions. Second operand 20 states. [2019-10-01 23:55:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:43,089 INFO L93 Difference]: Finished difference Result 272 states and 331 transitions. [2019-10-01 23:55:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:55:43,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 142 [2019-10-01 23:55:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:43,100 INFO L225 Difference]: With dead ends: 272 [2019-10-01 23:55:43,100 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 23:55:43,101 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 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:55:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 23:55:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-01 23:55:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 23:55:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 258 transitions. [2019-10-01 23:55:43,107 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 258 transitions. Word has length 142 [2019-10-01 23:55:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:43,108 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 258 transitions. [2019-10-01 23:55:43,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:55:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 258 transitions. [2019-10-01 23:55:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 23:55:43,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:43,110 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:43,110 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1226819561, now seen corresponding path program 14 times [2019-10-01 23:55:43,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:43,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-10-01 23:55:43,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:43,366 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:55:43,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:43,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:43,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:55:43,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-10-01 23:55:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:55:43,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:55:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:55:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:43,491 INFO L87 Difference]: Start difference. First operand 205 states and 258 transitions. Second operand 21 states. [2019-10-01 23:55:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:43,820 INFO L93 Difference]: Finished difference Result 286 states and 348 transitions. [2019-10-01 23:55:43,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:55:43,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2019-10-01 23:55:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:43,822 INFO L225 Difference]: With dead ends: 286 [2019-10-01 23:55:43,822 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 23:55:43,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 23:55:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-01 23:55:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-01 23:55:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 272 transitions. [2019-10-01 23:55:43,830 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 272 transitions. Word has length 150 [2019-10-01 23:55:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:43,830 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 272 transitions. [2019-10-01 23:55:43,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:55:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2019-10-01 23:55:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-01 23:55:43,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:43,832 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:43,832 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:43,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1710801491, now seen corresponding path program 15 times [2019-10-01 23:55:43,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 23:55:44,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:44,117 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:55:44,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:45,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 23:55:45,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:45,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:55:45,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 23:55:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:55:45,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:55:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:55:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:45,069 INFO L87 Difference]: Start difference. First operand 216 states and 272 transitions. Second operand 22 states. [2019-10-01 23:55:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:45,404 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2019-10-01 23:55:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:55:45,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 158 [2019-10-01 23:55:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:45,406 INFO L225 Difference]: With dead ends: 300 [2019-10-01 23:55:45,406 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 23:55:45,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 23:55:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-10-01 23:55:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 23:55:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 286 transitions. [2019-10-01 23:55:45,416 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 286 transitions. Word has length 158 [2019-10-01 23:55:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:45,417 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 286 transitions. [2019-10-01 23:55:45,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:55:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 286 transitions. [2019-10-01 23:55:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 23:55:45,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:45,419 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:45,419 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 280702807, now seen corresponding path program 16 times [2019-10-01 23:55:45,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-10-01 23:55:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:45,931 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:55:45,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:46,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:46,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:46,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:55:46,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:55:46,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:46,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:55:46,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:55:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:55:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:46,145 INFO L87 Difference]: Start difference. First operand 227 states and 286 transitions. Second operand 23 states. [2019-10-01 23:55:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:46,502 INFO L93 Difference]: Finished difference Result 314 states and 382 transitions. [2019-10-01 23:55:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:55:46,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 166 [2019-10-01 23:55:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:46,504 INFO L225 Difference]: With dead ends: 314 [2019-10-01 23:55:46,504 INFO L226 Difference]: Without dead ends: 246 [2019-10-01 23:55:46,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-01 23:55:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2019-10-01 23:55:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 23:55:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2019-10-01 23:55:46,513 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 166 [2019-10-01 23:55:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:46,514 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2019-10-01 23:55:46,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:55:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2019-10-01 23:55:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 23:55:46,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:46,515 INFO L411 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:46,515 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash 870108269, now seen corresponding path program 17 times [2019-10-01 23:55:46,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:46,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:46,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:46,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-10-01 23:55:46,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:46,808 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:55:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:47,041 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 23:55:47,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:47,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:55:47,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-10-01 23:55:47,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:55:47,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:55:47,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:55:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:55:47,112 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand 24 states. [2019-10-01 23:55:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:47,456 INFO L93 Difference]: Finished difference Result 328 states and 399 transitions. [2019-10-01 23:55:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:55:47,459 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 174 [2019-10-01 23:55:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:47,460 INFO L225 Difference]: With dead ends: 328 [2019-10-01 23:55:47,460 INFO L226 Difference]: Without dead ends: 257 [2019-10-01 23:55:47,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 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:55:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-01 23:55:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2019-10-01 23:55:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-01 23:55:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 314 transitions. [2019-10-01 23:55:47,469 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 314 transitions. Word has length 174 [2019-10-01 23:55:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:47,469 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 314 transitions. [2019-10-01 23:55:47,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:55:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 314 transitions. [2019-10-01 23:55:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-01 23:55:47,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:47,471 INFO L411 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:47,472 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -595134825, now seen corresponding path program 18 times [2019-10-01 23:55:47,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:47,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-10-01 23:55:47,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:47,793 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:55:47,818 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:55:48,966 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 23:55:48,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:48,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:55:48,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:49,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:55:49,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:55:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:55:49,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:55:49,020 INFO L87 Difference]: Start difference. First operand 249 states and 314 transitions. Second operand 25 states. [2019-10-01 23:55:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:49,368 INFO L93 Difference]: Finished difference Result 342 states and 416 transitions. [2019-10-01 23:55:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:55:49,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-10-01 23:55:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:49,372 INFO L225 Difference]: With dead ends: 342 [2019-10-01 23:55:49,372 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 23:55:49,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 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:55:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 23:55:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2019-10-01 23:55:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 23:55:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2019-10-01 23:55:49,380 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 182 [2019-10-01 23:55:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:49,380 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2019-10-01 23:55:49,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:55:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2019-10-01 23:55:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 23:55:49,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:49,382 INFO L411 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:49,382 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1863087315, now seen corresponding path program 19 times [2019-10-01 23:55:49,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2019-10-01 23:55:49,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:49,817 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:55:49,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:49,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:55:49,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-01 23:55:49,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:55:49,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:55:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:55:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:55:49,985 INFO L87 Difference]: Start difference. First operand 260 states and 328 transitions. Second operand 26 states. [2019-10-01 23:55:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:50,316 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2019-10-01 23:55:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:55:50,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-10-01 23:55:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:50,325 INFO L225 Difference]: With dead ends: 356 [2019-10-01 23:55:50,326 INFO L226 Difference]: Without dead ends: 279 [2019-10-01 23:55:50,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 190 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:55:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-01 23:55:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2019-10-01 23:55:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-01 23:55:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 342 transitions. [2019-10-01 23:55:50,333 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 342 transitions. Word has length 190 [2019-10-01 23:55:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:50,334 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 342 transitions. [2019-10-01 23:55:50,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:55:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 342 transitions. [2019-10-01 23:55:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-01 23:55:50,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:50,335 INFO L411 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:50,336 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:50,336 INFO L82 PathProgramCache]: Analyzing trace with hash 535268823, now seen corresponding path program 20 times [2019-10-01 23:55:50,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:50,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2019-10-01 23:55:50,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:50,858 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:55:50,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:51,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:51,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:51,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:55:51,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-10-01 23:55:51,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:51,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:55:51,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:55:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:55:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:55:51,088 INFO L87 Difference]: Start difference. First operand 271 states and 342 transitions. Second operand 27 states. [2019-10-01 23:55:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:51,455 INFO L93 Difference]: Finished difference Result 370 states and 450 transitions. [2019-10-01 23:55:51,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:55:51,455 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2019-10-01 23:55:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:51,457 INFO L225 Difference]: With dead ends: 370 [2019-10-01 23:55:51,457 INFO L226 Difference]: Without dead ends: 290 [2019-10-01 23:55:51,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 198 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:55:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-01 23:55:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2019-10-01 23:55:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-01 23:55:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 356 transitions. [2019-10-01 23:55:51,467 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 356 transitions. Word has length 198 [2019-10-01 23:55:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:51,468 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 356 transitions. [2019-10-01 23:55:51,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:55:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 356 transitions. [2019-10-01 23:55:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 23:55:51,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:51,470 INFO L411 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:51,470 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1361541613, now seen corresponding path program 21 times [2019-10-01 23:55:51,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:51,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:51,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:55:51,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:51,866 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:55:51,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:52,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-01 23:55:52,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:52,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:55:52,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:55:52,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:55:52,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:55:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:55:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:55:52,561 INFO L87 Difference]: Start difference. First operand 282 states and 356 transitions. Second operand 28 states. [2019-10-01 23:55:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:52,951 INFO L93 Difference]: Finished difference Result 384 states and 467 transitions. [2019-10-01 23:55:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:55:52,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 206 [2019-10-01 23:55:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:52,955 INFO L225 Difference]: With dead ends: 384 [2019-10-01 23:55:52,955 INFO L226 Difference]: Without dead ends: 301 [2019-10-01 23:55:52,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:55:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-01 23:55:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2019-10-01 23:55:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-01 23:55:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 370 transitions. [2019-10-01 23:55:52,965 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 370 transitions. Word has length 206 [2019-10-01 23:55:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:52,965 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 370 transitions. [2019-10-01 23:55:52,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:55:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 370 transitions. [2019-10-01 23:55:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 23:55:52,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:52,968 INFO L411 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:52,968 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 360772887, now seen corresponding path program 22 times [2019-10-01 23:55:52,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:52,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2019-10-01 23:55:53,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:53,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:53,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:53,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:53,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:55:53,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-10-01 23:55:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:55:53,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:55:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:55:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:55:53,621 INFO L87 Difference]: Start difference. First operand 293 states and 370 transitions. Second operand 29 states. [2019-10-01 23:55:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:54,062 INFO L93 Difference]: Finished difference Result 398 states and 484 transitions. [2019-10-01 23:55:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:55:54,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 214 [2019-10-01 23:55:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:54,065 INFO L225 Difference]: With dead ends: 398 [2019-10-01 23:55:54,065 INFO L226 Difference]: Without dead ends: 312 [2019-10-01 23:55:54,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 214 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:55:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-01 23:55:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-10-01 23:55:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:55:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 384 transitions. [2019-10-01 23:55:54,075 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 384 transitions. Word has length 214 [2019-10-01 23:55:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:54,076 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 384 transitions. [2019-10-01 23:55:54,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:55:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 384 transitions. [2019-10-01 23:55:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 23:55:54,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:54,078 INFO L411 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:54,079 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1084974931, now seen corresponding path program 23 times [2019-10-01 23:55:54,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:54,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2019-10-01 23:55:54,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:54,704 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:55:54,763 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:55,491 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 23:55:55,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:55,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:55:55,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-10-01 23:55:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:55:55,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:55:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:55:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:55:55,555 INFO L87 Difference]: Start difference. First operand 304 states and 384 transitions. Second operand 30 states. [2019-10-01 23:55:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:55,980 INFO L93 Difference]: Finished difference Result 412 states and 501 transitions. [2019-10-01 23:55:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:55:55,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 222 [2019-10-01 23:55:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:55,983 INFO L225 Difference]: With dead ends: 412 [2019-10-01 23:55:55,983 INFO L226 Difference]: Without dead ends: 323 [2019-10-01 23:55:55,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 222 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:55:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-01 23:55:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 315. [2019-10-01 23:55:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-01 23:55:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 398 transitions. [2019-10-01 23:55:55,992 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 398 transitions. Word has length 222 [2019-10-01 23:55:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:55,992 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 398 transitions. [2019-10-01 23:55:55,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:55:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 398 transitions. [2019-10-01 23:55:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 23:55:55,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:55,995 INFO L411 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:55,995 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1828138071, now seen corresponding path program 24 times [2019-10-01 23:55:55,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:55,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:55,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2889 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2019-10-01 23:55:56,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:56,422 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:55:56,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:56:01,357 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 23:56:01,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:01,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:56:01,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2889 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2019-10-01 23:56:01,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:01,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:56:01,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:56:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:56:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:01,467 INFO L87 Difference]: Start difference. First operand 315 states and 398 transitions. Second operand 31 states. [2019-10-01 23:56:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:01,987 INFO L93 Difference]: Finished difference Result 426 states and 518 transitions. [2019-10-01 23:56:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:56:01,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 230 [2019-10-01 23:56:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:01,990 INFO L225 Difference]: With dead ends: 426 [2019-10-01 23:56:01,990 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 23:56:01,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 23:56:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2019-10-01 23:56:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-10-01 23:56:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 412 transitions. [2019-10-01 23:56:02,003 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 412 transitions. Word has length 230 [2019-10-01 23:56:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:02,004 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 412 transitions. [2019-10-01 23:56:02,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:56:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 412 transitions. [2019-10-01 23:56:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 23:56:02,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:02,006 INFO L411 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:02,007 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1856575635, now seen corresponding path program 25 times [2019-10-01 23:56:02,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:02,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:02,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:02,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1918 trivial. 0 not checked. [2019-10-01 23:56:02,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:02,638 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:56:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:02,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:56:02,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-10-01 23:56:02,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:02,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:56:02,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:56:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:56:02,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:56:02,860 INFO L87 Difference]: Start difference. First operand 326 states and 412 transitions. Second operand 32 states. [2019-10-01 23:56:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:03,368 INFO L93 Difference]: Finished difference Result 440 states and 535 transitions. [2019-10-01 23:56:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:56:03,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 238 [2019-10-01 23:56:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:03,370 INFO L225 Difference]: With dead ends: 440 [2019-10-01 23:56:03,370 INFO L226 Difference]: Without dead ends: 345 [2019-10-01 23:56:03,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 238 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:56:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-01 23:56:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2019-10-01 23:56:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-01 23:56:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 426 transitions. [2019-10-01 23:56:03,379 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 426 transitions. Word has length 238 [2019-10-01 23:56:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:03,380 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 426 transitions. [2019-10-01 23:56:03,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:56:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 426 transitions. [2019-10-01 23:56:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 23:56:03,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:03,382 INFO L411 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:03,382 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1964100713, now seen corresponding path program 26 times [2019-10-01 23:56:03,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:03,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:03,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2019-10-01 23:56:04,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:04,037 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:56:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:56:04,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:56:04,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:04,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:56:04,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-10-01 23:56:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:56:04,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:56:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:56:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:56:04,248 INFO L87 Difference]: Start difference. First operand 337 states and 426 transitions. Second operand 33 states. [2019-10-01 23:56:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:04,722 INFO L93 Difference]: Finished difference Result 454 states and 552 transitions. [2019-10-01 23:56:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:56:04,723 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 246 [2019-10-01 23:56:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:04,726 INFO L225 Difference]: With dead ends: 454 [2019-10-01 23:56:04,726 INFO L226 Difference]: Without dead ends: 356 [2019-10-01 23:56:04,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:56:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-01 23:56:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 348. [2019-10-01 23:56:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-01 23:56:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 440 transitions. [2019-10-01 23:56:04,735 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 440 transitions. Word has length 246 [2019-10-01 23:56:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:04,736 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 440 transitions. [2019-10-01 23:56:04,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:56:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 440 transitions. [2019-10-01 23:56:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 23:56:04,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:04,738 INFO L411 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:04,738 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1475713491, now seen corresponding path program 27 times [2019-10-01 23:56:04,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:04,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:04,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:04,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:04,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2019-10-01 23:56:05,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:05,457 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:56:05,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:56:08,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-10-01 23:56:08,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:56:08,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-10-01 23:56:08,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:08,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:56:08,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:56:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:56:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:56:08,703 INFO L87 Difference]: Start difference. First operand 348 states and 440 transitions. Second operand 34 states. [2019-10-01 23:56:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:09,184 INFO L93 Difference]: Finished difference Result 468 states and 569 transitions. [2019-10-01 23:56:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:56:09,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 254 [2019-10-01 23:56:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:09,187 INFO L225 Difference]: With dead ends: 468 [2019-10-01 23:56:09,187 INFO L226 Difference]: Without dead ends: 367 [2019-10-01 23:56:09,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:56:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-01 23:56:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 359. [2019-10-01 23:56:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-01 23:56:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 454 transitions. [2019-10-01 23:56:09,198 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 454 transitions. Word has length 254 [2019-10-01 23:56:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:09,199 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 454 transitions. [2019-10-01 23:56:09,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:56:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 454 transitions. [2019-10-01 23:56:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-01 23:56:09,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:09,201 INFO L411 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:09,201 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -922088745, now seen corresponding path program 28 times [2019-10-01 23:56:09,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:09,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3813 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 2356 trivial. 0 not checked. [2019-10-01 23:56:09,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:09,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:10,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:56:10,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:56:10,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:10,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:56:10,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3813 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-10-01 23:56:10,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:10,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:56:10,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:56:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:56:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:56:10,195 INFO L87 Difference]: Start difference. First operand 359 states and 454 transitions. Second operand 35 states. [2019-10-01 23:56:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:10,781 INFO L93 Difference]: Finished difference Result 482 states and 586 transitions. [2019-10-01 23:56:10,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:56:10,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 262 [2019-10-01 23:56:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:10,784 INFO L225 Difference]: With dead ends: 482 [2019-10-01 23:56:10,784 INFO L226 Difference]: Without dead ends: 378 [2019-10-01 23:56:10,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:56:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-01 23:56:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-01 23:56:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-01 23:56:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 468 transitions. [2019-10-01 23:56:10,798 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 468 transitions. Word has length 262 [2019-10-01 23:56:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:10,798 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 468 transitions. [2019-10-01 23:56:10,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:56:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 468 transitions. [2019-10-01 23:56:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-01 23:56:10,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:10,802 INFO L411 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:10,803 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -817163027, now seen corresponding path program 29 times [2019-10-01 23:56:10,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:10,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:10,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4064 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2019-10-01 23:56:11,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:11,535 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:56:14,125 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:56:14,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:56:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4064 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:14,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:14,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:56:14,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:56:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:56:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:56:14,227 INFO L87 Difference]: Start difference. First operand 370 states and 468 transitions. Second operand 36 states. [2019-10-01 23:56:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:14,732 INFO L93 Difference]: Finished difference Result 496 states and 603 transitions. [2019-10-01 23:56:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:56:14,738 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 270 [2019-10-01 23:56:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:14,740 INFO L225 Difference]: With dead ends: 496 [2019-10-01 23:56:14,740 INFO L226 Difference]: Without dead ends: 389 [2019-10-01 23:56:14,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:56:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-01 23:56:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2019-10-01 23:56:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-01 23:56:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 482 transitions. [2019-10-01 23:56:14,750 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 482 transitions. Word has length 270 [2019-10-01 23:56:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:14,750 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 482 transitions. [2019-10-01 23:56:14,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:56:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 482 transitions. [2019-10-01 23:56:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 23:56:14,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:14,752 INFO L411 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:14,753 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1242648041, now seen corresponding path program 30 times [2019-10-01 23:56:14,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:14,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 2673 trivial. 0 not checked. [2019-10-01 23:56:15,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:15,451 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:56:26,753 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-10-01 23:56:26,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:56:26,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:56:26,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:56:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:56:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:56:26,870 INFO L87 Difference]: Start difference. First operand 381 states and 482 transitions. Second operand 37 states. [2019-10-01 23:56:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:27,490 INFO L93 Difference]: Finished difference Result 510 states and 620 transitions. [2019-10-01 23:56:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:56:27,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 278 [2019-10-01 23:56:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:27,493 INFO L225 Difference]: With dead ends: 510 [2019-10-01 23:56:27,493 INFO L226 Difference]: Without dead ends: 400 [2019-10-01 23:56:27,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:56:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-10-01 23:56:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2019-10-01 23:56:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-01 23:56:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 496 transitions. [2019-10-01 23:56:27,504 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 496 transitions. Word has length 278 [2019-10-01 23:56:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:27,504 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 496 transitions. [2019-10-01 23:56:27,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:56:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 496 transitions. [2019-10-01 23:56:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 23:56:27,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:27,508 INFO L411 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:27,509 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2113205165, now seen corresponding path program 31 times [2019-10-01 23:56:27,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:27,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:27,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:27,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:27,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2019-10-01 23:56:28,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:28,321 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:28,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:28,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:56:28,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:28,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:28,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:56:28,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:56:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:56:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:56:28,598 INFO L87 Difference]: Start difference. First operand 392 states and 496 transitions. Second operand 38 states. [2019-10-01 23:56:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:29,358 INFO L93 Difference]: Finished difference Result 524 states and 637 transitions. [2019-10-01 23:56:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:56:29,359 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 286 [2019-10-01 23:56:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:29,361 INFO L225 Difference]: With dead ends: 524 [2019-10-01 23:56:29,361 INFO L226 Difference]: Without dead ends: 411 [2019-10-01 23:56:29,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:56:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-01 23:56:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 403. [2019-10-01 23:56:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-10-01 23:56:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 510 transitions. [2019-10-01 23:56:29,370 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 510 transitions. Word has length 286 [2019-10-01 23:56:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:29,371 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 510 transitions. [2019-10-01 23:56:29,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:56:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 510 transitions. [2019-10-01 23:56:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-01 23:56:29,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:29,374 INFO L411 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:29,374 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1430268247, now seen corresponding path program 32 times [2019-10-01 23:56:29,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:29,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:29,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4865 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2019-10-01 23:56:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:29,986 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:56:30,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:56:30,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:30,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:56:30,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4865 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-10-01 23:56:30,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:30,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:56:30,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:56:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:56:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:56:30,236 INFO L87 Difference]: Start difference. First operand 403 states and 510 transitions. Second operand 39 states. [2019-10-01 23:56:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:30,875 INFO L93 Difference]: Finished difference Result 538 states and 654 transitions. [2019-10-01 23:56:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:56:30,881 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 294 [2019-10-01 23:56:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:30,883 INFO L225 Difference]: With dead ends: 538 [2019-10-01 23:56:30,883 INFO L226 Difference]: Without dead ends: 422 [2019-10-01 23:56:30,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:56:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-10-01 23:56:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2019-10-01 23:56:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-10-01 23:56:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 524 transitions. [2019-10-01 23:56:30,893 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 524 transitions. Word has length 294 [2019-10-01 23:56:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:30,893 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 524 transitions. [2019-10-01 23:56:30,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:56:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 524 transitions. [2019-10-01 23:56:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 23:56:30,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:30,896 INFO L411 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:30,896 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1780219283, now seen corresponding path program 33 times [2019-10-01 23:56:30,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:30,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:30,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2019-10-01 23:56:31,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:31,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:31,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:56:39,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-10-01 23:56:39,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:39,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:56:39,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2019-10-01 23:56:39,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:39,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 23:56:39,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 23:56:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 23:56:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:56:39,720 INFO L87 Difference]: Start difference. First operand 414 states and 524 transitions. Second operand 40 states. [2019-10-01 23:56:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:40,335 INFO L93 Difference]: Finished difference Result 552 states and 671 transitions. [2019-10-01 23:56:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:56:40,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 302 [2019-10-01 23:56:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:40,337 INFO L225 Difference]: With dead ends: 552 [2019-10-01 23:56:40,337 INFO L226 Difference]: Without dead ends: 433 [2019-10-01 23:56:40,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:56:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-01 23:56:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2019-10-01 23:56:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-01 23:56:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 538 transitions. [2019-10-01 23:56:40,348 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 538 transitions. Word has length 302 [2019-10-01 23:56:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:40,348 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 538 transitions. [2019-10-01 23:56:40,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 23:56:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2019-10-01 23:56:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 23:56:40,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:40,351 INFO L411 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:40,351 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1604481175, now seen corresponding path program 34 times [2019-10-01 23:56:40,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:40,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 3367 trivial. 0 not checked. [2019-10-01 23:56:41,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:41,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:41,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:56:41,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:56:41,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:56:41,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2019-10-01 23:56:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:41,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:56:41,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:56:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:56:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:56:41,347 INFO L87 Difference]: Start difference. First operand 425 states and 538 transitions. Second operand 41 states. [2019-10-01 23:56:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:41,998 INFO L93 Difference]: Finished difference Result 566 states and 688 transitions. [2019-10-01 23:56:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:56:41,999 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 310 [2019-10-01 23:56:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:42,003 INFO L225 Difference]: With dead ends: 566 [2019-10-01 23:56:42,003 INFO L226 Difference]: Without dead ends: 444 [2019-10-01 23:56:42,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:56:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-01 23:56:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2019-10-01 23:56:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-10-01 23:56:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 552 transitions. [2019-10-01 23:56:42,013 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 552 transitions. Word has length 310 [2019-10-01 23:56:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:42,014 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 552 transitions. [2019-10-01 23:56:42,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:56:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 552 transitions. [2019-10-01 23:56:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-01 23:56:42,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:42,016 INFO L411 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:42,017 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 603210029, now seen corresponding path program 35 times [2019-10-01 23:56:42,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:42,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:42,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5738 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 3553 trivial. 0 not checked. [2019-10-01 23:56:42,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:42,785 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:42,835 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:56:44,534 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-10-01 23:56:44,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:44,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:56:44,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5738 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2019-10-01 23:56:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:44,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:56:44,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:56:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:56:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:56:44,620 INFO L87 Difference]: Start difference. First operand 436 states and 552 transitions. Second operand 42 states. [2019-10-01 23:56:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:45,166 INFO L93 Difference]: Finished difference Result 580 states and 705 transitions. [2019-10-01 23:56:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:56:45,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 318 [2019-10-01 23:56:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:45,170 INFO L225 Difference]: With dead ends: 580 [2019-10-01 23:56:45,170 INFO L226 Difference]: Without dead ends: 455 [2019-10-01 23:56:45,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:56:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-01 23:56:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 447. [2019-10-01 23:56:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-01 23:56:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 566 transitions. [2019-10-01 23:56:45,180 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 566 transitions. Word has length 318 [2019-10-01 23:56:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:45,181 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 566 transitions. [2019-10-01 23:56:45,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:56:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 566 transitions. [2019-10-01 23:56:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 23:56:45,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:45,183 INFO L411 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:45,184 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2101770281, now seen corresponding path program 36 times [2019-10-01 23:56:45,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:45,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2019-10-01 23:56:46,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:46,050 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:46,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:57:11,603 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-10-01 23:57:11,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:11,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:57:11,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2019-10-01 23:57:11,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:11,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 23:57:11,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:57:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:57:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:57:11,776 INFO L87 Difference]: Start difference. First operand 447 states and 566 transitions. Second operand 43 states. [2019-10-01 23:57:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:12,593 INFO L93 Difference]: Finished difference Result 594 states and 722 transitions. [2019-10-01 23:57:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:57:12,593 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 326 [2019-10-01 23:57:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:12,595 INFO L225 Difference]: With dead ends: 594 [2019-10-01 23:57:12,595 INFO L226 Difference]: Without dead ends: 466 [2019-10-01 23:57:12,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:57:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-01 23:57:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 458. [2019-10-01 23:57:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-01 23:57:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 580 transitions. [2019-10-01 23:57:12,605 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 580 transitions. Word has length 326 [2019-10-01 23:57:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:12,606 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 580 transitions. [2019-10-01 23:57:12,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:57:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 580 transitions. [2019-10-01 23:57:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-01 23:57:12,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:12,609 INFO L411 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:12,609 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 536981485, now seen corresponding path program 37 times [2019-10-01 23:57:12,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:12,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:12,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:12,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:12,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6360 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 3940 trivial. 0 not checked. [2019-10-01 23:57:13,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:13,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:57:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:13,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:57:13,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6360 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-10-01 23:57:14,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:14,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:57:14,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:57:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:57:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:57:14,047 INFO L87 Difference]: Start difference. First operand 458 states and 580 transitions. Second operand 44 states. [2019-10-01 23:57:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:14,756 INFO L93 Difference]: Finished difference Result 608 states and 739 transitions. [2019-10-01 23:57:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:57:14,760 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 334 [2019-10-01 23:57:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:14,762 INFO L225 Difference]: With dead ends: 608 [2019-10-01 23:57:14,762 INFO L226 Difference]: Without dead ends: 477 [2019-10-01 23:57:14,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:57:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-01 23:57:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2019-10-01 23:57:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-01 23:57:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 594 transitions. [2019-10-01 23:57:14,773 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 594 transitions. Word has length 334 [2019-10-01 23:57:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:14,773 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 594 transitions. [2019-10-01 23:57:14,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:57:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 594 transitions. [2019-10-01 23:57:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-01 23:57:14,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:14,776 INFO L411 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:14,776 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1591120105, now seen corresponding path program 38 times [2019-10-01 23:57:14,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:57:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6683 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 4141 trivial. 0 not checked. [2019-10-01 23:57:15,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:15,586 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:57:15,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:57:15,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:15,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:57:15,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6683 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2019-10-01 23:57:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:15,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:57:15,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:57:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:57:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:57:15,858 INFO L87 Difference]: Start difference. First operand 469 states and 594 transitions. Second operand 45 states. [2019-10-01 23:57:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:16,562 INFO L93 Difference]: Finished difference Result 622 states and 756 transitions. [2019-10-01 23:57:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:57:16,562 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 342 [2019-10-01 23:57:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:16,564 INFO L225 Difference]: With dead ends: 622 [2019-10-01 23:57:16,564 INFO L226 Difference]: Without dead ends: 488 [2019-10-01 23:57:16,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:57:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-01 23:57:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2019-10-01 23:57:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-10-01 23:57:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 608 transitions. [2019-10-01 23:57:16,574 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 608 transitions. Word has length 342 [2019-10-01 23:57:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:16,575 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 608 transitions. [2019-10-01 23:57:16,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:57:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 608 transitions. [2019-10-01 23:57:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-01 23:57:16,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:16,578 INFO L411 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:16,578 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 753421997, now seen corresponding path program 39 times [2019-10-01 23:57:16,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:16,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7014 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-10-01 23:57:17,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:17,533 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:17,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:58:02,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-10-01 23:58:02,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:02,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:58:02,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7014 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2019-10-01 23:58:02,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 23:58:02,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 23:58:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 23:58:02,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:58:02,791 INFO L87 Difference]: Start difference. First operand 480 states and 608 transitions. Second operand 46 states. [2019-10-01 23:58:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:03,544 INFO L93 Difference]: Finished difference Result 636 states and 773 transitions. [2019-10-01 23:58:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:58:03,544 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 350 [2019-10-01 23:58:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:03,547 INFO L225 Difference]: With dead ends: 636 [2019-10-01 23:58:03,547 INFO L226 Difference]: Without dead ends: 499 [2019-10-01 23:58:03,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:58:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-01 23:58:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 491. [2019-10-01 23:58:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-01 23:58:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 622 transitions. [2019-10-01 23:58:03,558 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 622 transitions. Word has length 350 [2019-10-01 23:58:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:03,558 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 622 transitions. [2019-10-01 23:58:03,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 23:58:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 622 transitions. [2019-10-01 23:58:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-01 23:58:03,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:03,561 INFO L411 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:03,561 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash 311830103, now seen corresponding path program 40 times [2019-10-01 23:58:03,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:03,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7353 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 4558 trivial. 0 not checked. [2019-10-01 23:58:04,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:04,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:04,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:58:04,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:58:04,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:04,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:58:04,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7353 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2019-10-01 23:58:04,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:04,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:58:04,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:58:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:58:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:58:04,795 INFO L87 Difference]: Start difference. First operand 491 states and 622 transitions. Second operand 47 states. [2019-10-01 23:58:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:05,499 INFO L93 Difference]: Finished difference Result 650 states and 790 transitions. [2019-10-01 23:58:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:58:05,500 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 358 [2019-10-01 23:58:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:05,502 INFO L225 Difference]: With dead ends: 650 [2019-10-01 23:58:05,502 INFO L226 Difference]: Without dead ends: 510 [2019-10-01 23:58:05,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:58:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-01 23:58:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 502. [2019-10-01 23:58:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-01 23:58:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2019-10-01 23:58:05,511 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 358 [2019-10-01 23:58:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:05,511 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2019-10-01 23:58:05,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:58:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2019-10-01 23:58:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-01 23:58:05,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:05,514 INFO L411 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:05,514 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1485053293, now seen corresponding path program 41 times [2019-10-01 23:58:05,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:05,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:05,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 4774 trivial. 0 not checked. [2019-10-01 23:58:06,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:06,449 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:58:19,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-10-01 23:58:19,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:19,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:58:19,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-10-01 23:58:19,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:19,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 23:58:19,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:58:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:58:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:58:19,608 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand 48 states. [2019-10-01 23:58:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:20,374 INFO L93 Difference]: Finished difference Result 664 states and 807 transitions. [2019-10-01 23:58:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:58:20,375 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 366 [2019-10-01 23:58:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:20,378 INFO L225 Difference]: With dead ends: 664 [2019-10-01 23:58:20,378 INFO L226 Difference]: Without dead ends: 521 [2019-10-01 23:58:20,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:58:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-01 23:58:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 513. [2019-10-01 23:58:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-10-01 23:58:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 650 transitions. [2019-10-01 23:58:20,388 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 650 transitions. Word has length 366 [2019-10-01 23:58:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:20,388 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 650 transitions. [2019-10-01 23:58:20,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:58:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 650 transitions. [2019-10-01 23:58:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-01 23:58:20,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:20,391 INFO L411 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:20,391 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash -475812457, now seen corresponding path program 42 times [2019-10-01 23:58:20,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:20,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:20,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8055 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4995 trivial. 0 not checked. [2019-10-01 23:58:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:21,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:00:54,295 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-10-02 00:00:54,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:00:54,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 00:00:54,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8055 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4995 trivial. 0 not checked. [2019-10-02 00:00:54,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:54,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-02 00:00:54,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 00:00:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 00:00:54,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 00:00:54,485 INFO L87 Difference]: Start difference. First operand 513 states and 650 transitions. Second operand 49 states. [2019-10-02 00:00:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:55,462 INFO L93 Difference]: Finished difference Result 678 states and 824 transitions. [2019-10-02 00:00:55,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 00:00:55,463 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 374 [2019-10-02 00:00:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:55,465 INFO L225 Difference]: With dead ends: 678 [2019-10-02 00:00:55,465 INFO L226 Difference]: Without dead ends: 532 [2019-10-02 00:00:55,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 00:00:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-02 00:00:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 524. [2019-10-02 00:00:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-10-02 00:00:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 664 transitions. [2019-10-02 00:00:55,475 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 664 transitions. Word has length 374 [2019-10-02 00:00:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:55,476 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 664 transitions. [2019-10-02 00:00:55,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 00:00:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 664 transitions. [2019-10-02 00:00:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 00:00:55,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:55,479 INFO L411 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:55,479 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -609149907, now seen corresponding path program 43 times [2019-10-02 00:00:55,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:55,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:55,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:00:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 5221 trivial. 0 not checked. [2019-10-02 00:00:56,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:00:56,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:00:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:00:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:56,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 00:00:56,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-10-02 00:00:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-02 00:00:56,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 00:00:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 00:00:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 00:00:56,763 INFO L87 Difference]: Start difference. First operand 524 states and 664 transitions. Second operand 50 states. [2019-10-02 00:00:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:57,479 INFO L93 Difference]: Finished difference Result 692 states and 841 transitions. [2019-10-02 00:00:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 00:00:57,480 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 382 [2019-10-02 00:00:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:57,482 INFO L225 Difference]: With dead ends: 692 [2019-10-02 00:00:57,482 INFO L226 Difference]: Without dead ends: 543 [2019-10-02 00:00:57,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 00:00:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-10-02 00:00:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 535. [2019-10-02 00:00:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-02 00:00:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 678 transitions. [2019-10-02 00:00:57,492 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 678 transitions. Word has length 382 [2019-10-02 00:00:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:57,492 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 678 transitions. [2019-10-02 00:00:57,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 00:00:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 678 transitions. [2019-10-02 00:00:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 00:00:57,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:57,495 INFO L411 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:57,495 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash 368444631, now seen corresponding path program 44 times [2019-10-02 00:00:57,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:00:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8789 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 5452 trivial. 0 not checked. [2019-10-02 00:00:58,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:00:58,651 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:00:58,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:00:58,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:00:58,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:00:58,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 00:00:58,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8789 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2019-10-02 00:00:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:58,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-02 00:00:58,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 00:00:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 00:00:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 00:00:58,944 INFO L87 Difference]: Start difference. First operand 535 states and 678 transitions. Second operand 51 states. [2019-10-02 00:00:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:59,872 INFO L93 Difference]: Finished difference Result 706 states and 858 transitions. [2019-10-02 00:00:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 00:00:59,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 390 [2019-10-02 00:00:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:59,876 INFO L225 Difference]: With dead ends: 706 [2019-10-02 00:00:59,876 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:00:59,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 00:00:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:00:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 546. [2019-10-02 00:00:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 00:00:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 692 transitions. [2019-10-02 00:00:59,883 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 692 transitions. Word has length 390 [2019-10-02 00:00:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:59,884 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 692 transitions. [2019-10-02 00:00:59,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 00:00:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 692 transitions. [2019-10-02 00:00:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 00:00:59,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:59,887 INFO L411 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:59,887 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -632599827, now seen corresponding path program 45 times [2019-10-02 00:00:59,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:59,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:00:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:01:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9168 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 5688 trivial. 0 not checked. [2019-10-02 00:01:01,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:01:01,051 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:01:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:02:45,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-10-02 00:02:45,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:02:45,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 00:02:45,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:02:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9168 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-10-02 00:02:45,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:02:45,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-02 00:02:45,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 00:02:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 00:02:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:02:45,685 INFO L87 Difference]: Start difference. First operand 546 states and 692 transitions. Second operand 52 states. [2019-10-02 00:02:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:02:46,535 INFO L93 Difference]: Finished difference Result 720 states and 875 transitions. [2019-10-02 00:02:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 00:02:46,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 398 [2019-10-02 00:02:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:02:46,539 INFO L225 Difference]: With dead ends: 720 [2019-10-02 00:02:46,539 INFO L226 Difference]: Without dead ends: 565 [2019-10-02 00:02:46,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:02:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-02 00:02:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 557. [2019-10-02 00:02:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-02 00:02:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 706 transitions. [2019-10-02 00:02:46,548 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 706 transitions. Word has length 398 [2019-10-02 00:02:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:02:46,548 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 706 transitions. [2019-10-02 00:02:46,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 00:02:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 706 transitions. [2019-10-02 00:02:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-10-02 00:02:46,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:02:46,551 INFO L411 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:02:46,551 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:02:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:02:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -533648361, now seen corresponding path program 46 times [2019-10-02 00:02:46,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:02:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:02:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:46,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:02:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:02:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9555 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 5929 trivial. 0 not checked. [2019-10-02 00:02:47,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:02:47,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:02:47,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:02:47,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:02:47,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:02:47,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 00:02:47,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:02:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9555 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-10-02 00:02:47,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:02:47,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-02 00:02:47,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 00:02:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 00:02:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:02:47,940 INFO L87 Difference]: Start difference. First operand 557 states and 706 transitions. Second operand 53 states. [2019-10-02 00:02:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:02:48,648 INFO L93 Difference]: Finished difference Result 734 states and 892 transitions. [2019-10-02 00:02:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 00:02:48,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 406 [2019-10-02 00:02:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:02:48,652 INFO L225 Difference]: With dead ends: 734 [2019-10-02 00:02:48,652 INFO L226 Difference]: Without dead ends: 576 [2019-10-02 00:02:48,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:02:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-02 00:02:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 568. [2019-10-02 00:02:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 00:02:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 720 transitions. [2019-10-02 00:02:48,659 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 720 transitions. Word has length 406 [2019-10-02 00:02:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:02:48,659 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 720 transitions. [2019-10-02 00:02:48,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 00:02:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 720 transitions. [2019-10-02 00:02:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-02 00:02:48,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:02:48,662 INFO L411 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:02:48,663 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:02:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:02:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 590260653, now seen corresponding path program 47 times [2019-10-02 00:02:48,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:02:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:02:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:48,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:02:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:02:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9950 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2019-10-02 00:02:49,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:02:49,773 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:02:49,845 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:02:52,945 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-10-02 00:02:52,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:02:52,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 00:02:52,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:02:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9950 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2019-10-02 00:02:53,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:02:53,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-02 00:02:53,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 00:02:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 00:02:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:02:53,141 INFO L87 Difference]: Start difference. First operand 568 states and 720 transitions. Second operand 54 states. [2019-10-02 00:02:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:02:54,236 INFO L93 Difference]: Finished difference Result 748 states and 909 transitions. [2019-10-02 00:02:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 00:02:54,236 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 414 [2019-10-02 00:02:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:02:54,239 INFO L225 Difference]: With dead ends: 748 [2019-10-02 00:02:54,239 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 00:02:54,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:02:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 00:02:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 579. [2019-10-02 00:02:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-02 00:02:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 734 transitions. [2019-10-02 00:02:54,247 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 734 transitions. Word has length 414 [2019-10-02 00:02:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:02:54,247 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 734 transitions. [2019-10-02 00:02:54,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 00:02:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 734 transitions. [2019-10-02 00:02:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 00:02:54,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:02:54,250 INFO L411 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:02:54,250 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:02:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:02:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -302439593, now seen corresponding path program 48 times [2019-10-02 00:02:54,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:02:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:02:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:54,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:02:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:02:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:02:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10353 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 6426 trivial. 0 not checked. [2019-10-02 00:02:55,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:02:55,367 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:02:55,442 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:06:33,690 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-10-02 00:06:33,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:06:33,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 00:06:33,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:06:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10353 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 3927 trivial. 0 not checked. [2019-10-02 00:06:33,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:06:33,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-02 00:06:33,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 00:06:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 00:06:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 00:06:33,889 INFO L87 Difference]: Start difference. First operand 579 states and 734 transitions. Second operand 55 states. [2019-10-02 00:06:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:06:34,794 INFO L93 Difference]: Finished difference Result 762 states and 926 transitions. [2019-10-02 00:06:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 00:06:34,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 422 [2019-10-02 00:06:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:06:34,798 INFO L225 Difference]: With dead ends: 762 [2019-10-02 00:06:34,798 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 00:06:34,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 00:06:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 00:06:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2019-10-02 00:06:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 00:06:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 748 transitions. [2019-10-02 00:06:34,808 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 748 transitions. Word has length 422 [2019-10-02 00:06:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:06:34,809 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 748 transitions. [2019-10-02 00:06:34,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 00:06:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 748 transitions. [2019-10-02 00:06:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-02 00:06:34,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:06:34,812 INFO L411 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:06:34,812 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:06:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:06:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -264816531, now seen corresponding path program 49 times [2019-10-02 00:06:34,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:06:34,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:06:34,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:34,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:06:34,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:06:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10764 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 6682 trivial. 0 not checked. [2019-10-02 00:06:36,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:06:36,013 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:06:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:06:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:06:36,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 00:06:36,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:06:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10764 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-02 00:06:36,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:06:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-02 00:06:36,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 00:06:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 00:06:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 00:06:36,351 INFO L87 Difference]: Start difference. First operand 590 states and 748 transitions. Second operand 56 states. [2019-10-02 00:06:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:06:37,077 INFO L93 Difference]: Finished difference Result 776 states and 943 transitions. [2019-10-02 00:06:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 00:06:37,077 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 430 [2019-10-02 00:06:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:06:37,080 INFO L225 Difference]: With dead ends: 776 [2019-10-02 00:06:37,080 INFO L226 Difference]: Without dead ends: 609 [2019-10-02 00:06:37,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 00:06:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-10-02 00:06:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 601. [2019-10-02 00:06:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 00:06:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 762 transitions. [2019-10-02 00:06:37,086 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 762 transitions. Word has length 430 [2019-10-02 00:06:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:06:37,087 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 762 transitions. [2019-10-02 00:06:37,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 00:06:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 762 transitions. [2019-10-02 00:06:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 00:06:37,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:06:37,089 INFO L411 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:06:37,089 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:06:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:06:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1611535721, now seen corresponding path program 50 times [2019-10-02 00:06:37,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:06:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:06:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:06:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:06:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11183 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 6943 trivial. 0 not checked. [2019-10-02 00:06:38,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:06:38,312 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:06:38,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:06:38,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:06:38,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:06:38,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 00:06:38,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:06:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11183 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 4240 trivial. 0 not checked. [2019-10-02 00:06:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:06:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-02 00:06:38,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 00:06:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 00:06:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 00:06:38,657 INFO L87 Difference]: Start difference. First operand 601 states and 762 transitions. Second operand 57 states. [2019-10-02 00:06:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:06:39,495 INFO L93 Difference]: Finished difference Result 790 states and 960 transitions. [2019-10-02 00:06:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 00:06:39,496 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 438 [2019-10-02 00:06:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:06:39,499 INFO L225 Difference]: With dead ends: 790 [2019-10-02 00:06:39,499 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 00:06:39,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 00:06:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 00:06:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 612. [2019-10-02 00:06:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 00:06:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-02 00:06:39,508 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 438 [2019-10-02 00:06:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:06:39,508 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-02 00:06:39,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 00:06:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-02 00:06:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-02 00:06:39,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:06:39,512 INFO L411 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:06:39,512 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:06:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:06:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1505691859, now seen corresponding path program 51 times [2019-10-02 00:06:39,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:06:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:06:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:39,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:06:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:06:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:06:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11610 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 7209 trivial. 0 not checked. [2019-10-02 00:06:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:06:40,747 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:06:40,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:07:52,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-10-02 00:07:52,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:07:52,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-02 00:07:52,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:07:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11610 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 7209 trivial. 0 not checked. [2019-10-02 00:07:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:07:52,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-02 00:07:52,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 00:07:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 00:07:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 00:07:52,850 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 58 states. [2019-10-02 00:07:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:07:54,057 INFO L93 Difference]: Finished difference Result 804 states and 977 transitions. [2019-10-02 00:07:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 00:07:54,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 446 [2019-10-02 00:07:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:07:54,062 INFO L225 Difference]: With dead ends: 804 [2019-10-02 00:07:54,063 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 00:07:54,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 00:07:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 00:07:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 623. [2019-10-02 00:07:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 00:07:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 790 transitions. [2019-10-02 00:07:54,069 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 790 transitions. Word has length 446 [2019-10-02 00:07:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:07:54,070 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 790 transitions. [2019-10-02 00:07:54,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 00:07:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 790 transitions. [2019-10-02 00:07:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-10-02 00:07:54,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:07:54,072 INFO L411 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:07:54,072 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:07:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:07:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1270841815, now seen corresponding path program 52 times [2019-10-02 00:07:54,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:07:54,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:07:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:54,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:07:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:07:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12045 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 7480 trivial. 0 not checked. [2019-10-02 00:07:55,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:07:55,296 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:07:55,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:07:55,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:07:55,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:07:55,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 00:07:55,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:07:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12045 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2019-10-02 00:07:55,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:07:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-02 00:07:55,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 00:07:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 00:07:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 00:07:55,643 INFO L87 Difference]: Start difference. First operand 623 states and 790 transitions. Second operand 59 states. [2019-10-02 00:07:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:07:56,668 INFO L93 Difference]: Finished difference Result 818 states and 994 transitions. [2019-10-02 00:07:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 00:07:56,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 454 [2019-10-02 00:07:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:07:56,672 INFO L225 Difference]: With dead ends: 818 [2019-10-02 00:07:56,672 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 00:07:56,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 00:07:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 00:07:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2019-10-02 00:07:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-02 00:07:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 804 transitions. [2019-10-02 00:07:56,679 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 804 transitions. Word has length 454 [2019-10-02 00:07:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:07:56,679 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 804 transitions. [2019-10-02 00:07:56,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 00:07:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 804 transitions. [2019-10-02 00:07:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-10-02 00:07:56,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:07:56,681 INFO L411 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:07:56,682 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:07:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:07:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1792547347, now seen corresponding path program 53 times [2019-10-02 00:07:56,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:07:56,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:07:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:56,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:07:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:07:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12488 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 7756 trivial. 0 not checked. [2019-10-02 00:07:58,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:07:58,015 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:07:58,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:08:21,756 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-02 00:08:21,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:08:21,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-02 00:08:21,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:08:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12488 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 7756 trivial. 0 not checked. [2019-10-02 00:08:21,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:08:21,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-02 00:08:21,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-02 00:08:21,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-02 00:08:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 00:08:21,894 INFO L87 Difference]: Start difference. First operand 634 states and 804 transitions. Second operand 60 states. [2019-10-02 00:08:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:08:22,949 INFO L93 Difference]: Finished difference Result 832 states and 1011 transitions. [2019-10-02 00:08:22,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 00:08:22,949 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 462 [2019-10-02 00:08:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:08:22,951 INFO L225 Difference]: With dead ends: 832 [2019-10-02 00:08:22,951 INFO L226 Difference]: Without dead ends: 653 [2019-10-02 00:08:22,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 00:08:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-02 00:08:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2019-10-02 00:08:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 00:08:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 818 transitions. [2019-10-02 00:08:22,961 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 818 transitions. Word has length 462 [2019-10-02 00:08:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:08:22,962 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 818 transitions. [2019-10-02 00:08:22,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-02 00:08:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 818 transitions. [2019-10-02 00:08:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-10-02 00:08:22,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:08:22,965 INFO L411 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:08:22,965 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:08:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:08:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2080762135, now seen corresponding path program 54 times [2019-10-02 00:08:22,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:08:22,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:08:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:08:22,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:08:22,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:08:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:08:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12939 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 8037 trivial. 0 not checked. [2019-10-02 00:08:24,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:08:24,378 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:08:24,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE