java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:51:08,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:51:08,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:51:08,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:51:08,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:51:08,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:51:08,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:51:08,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:51:08,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:51:08,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:51:08,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:51:08,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:51:08,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:51:08,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:51:08,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:51:08,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:51:08,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:51:08,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:51:08,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:51:08,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:51:08,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:51:08,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:51:08,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:51:08,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:51:08,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:51:08,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:51:08,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:51:08,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:51:08,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:51:08,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:51:08,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:51:08,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:51:08,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:51:08,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:51:08,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:51:08,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:51:08,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:51:08,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:51:08,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:51:08,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:51:08,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:51:08,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:51:08,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:51:08,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:51:08,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:51:08,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:51:08,386 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:51:08,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:51:08,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:51:08,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:51:08,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:51:08,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:51:08,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:51:08,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:51:08,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:51:08,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:51:08,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:51:08,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:51:08,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:51:08,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:51:08,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:51:08,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:51:08,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:51:08,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:51:08,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:51:08,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:51:08,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:51:08,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:51:08,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:51:08,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:51:08,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:51:08,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:51:08,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:51:08,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:51:08,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:51:08,436 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:51:08,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr.i [2019-09-03 19:51:08,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee13827bc/aaf7878cd8a84fe18ee02eede5eea513/FLAG424cc39dc [2019-09-03 19:51:08,958 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:51:08,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr.i [2019-09-03 19:51:08,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee13827bc/aaf7878cd8a84fe18ee02eede5eea513/FLAG424cc39dc [2019-09-03 19:51:09,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee13827bc/aaf7878cd8a84fe18ee02eede5eea513 [2019-09-03 19:51:09,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:51:09,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:51:09,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:51:09,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:51:09,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:51:09,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac5711d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09, skipping insertion in model container [2019-09-03 19:51:09,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,401 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:51:09,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:51:09,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:51:09,587 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:51:09,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:51:09,614 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:51:09,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09 WrapperNode [2019-09-03 19:51:09,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:51:09,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:51:09,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:51:09,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:51:09,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... [2019-09-03 19:51:09,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:51:09,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:51:09,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:51:09,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:51:09,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:51:09,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:51:09,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:51:09,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:51:09,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:51:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:51:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:51:09,983 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:51:09,983 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:51:09,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:51:09 BoogieIcfgContainer [2019-09-03 19:51:09,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:51:09,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:51:09,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:51:09,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:51:09,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:51:09" (1/3) ... [2019-09-03 19:51:09,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f10daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:51:09, skipping insertion in model container [2019-09-03 19:51:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:09" (2/3) ... [2019-09-03 19:51:09,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f10daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:51:09, skipping insertion in model container [2019-09-03 19:51:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:51:09" (3/3) ... [2019-09-03 19:51:09,993 INFO L109 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i [2019-09-03 19:51:10,008 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:51:10,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:51:10,049 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:51:10,090 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:51:10,090 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:51:10,091 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:51:10,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:51:10,091 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:51:10,091 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:51:10,091 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:51:10,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:51:10,092 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:51:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-03 19:51:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:51:10,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,121 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1261819063, now seen corresponding path program 1 times [2019-09-03 19:51:10,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:51:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:51:10,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:51:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:51:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:51:10,248 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-03 19:51:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:10,268 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-03 19:51:10,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:51:10,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-03 19:51:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:10,278 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:51:10,279 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:51:10,282 INFO L628 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-09-03 19:51:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:51:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:51:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:51:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 19:51:10,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-03 19:51:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:10,324 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 19:51:10,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:51:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 19:51:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:51:10,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,326 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -599256242, now seen corresponding path program 1 times [2019-09-03 19:51:10,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:10,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:51:10,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:51:10,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:51:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:51:10,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:51:10,512 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2019-09-03 19:51:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:10,633 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-03 19:51:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:51:10,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 19:51:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:10,636 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:51:10,636 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:51:10,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:51:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:51:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:51:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:51:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 19:51:10,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-09-03 19:51:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:10,649 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 19:51:10,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:51:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 19:51:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:51:10,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,650 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,651 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1373758515, now seen corresponding path program 1 times [2019-09-03 19:51:10,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:51:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:51:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:51:10,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:51:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:51:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:51:10,752 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-03 19:51:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:10,816 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-03 19:51:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:51:10,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:51:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:10,818 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:51:10,818 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:51:10,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:51:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:51:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-09-03 19:51:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:51:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 19:51:10,828 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-09-03 19:51:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:10,829 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 19:51:10,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:51:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 19:51:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:51:10,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,832 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,833 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -684761303, now seen corresponding path program 1 times [2019-09-03 19:51:10,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:10,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:10,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:51:10,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:11,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-03 19:51:11,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:51:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:51:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:51:11,033 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-09-03 19:51:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:11,148 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-09-03 19:51:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:51:11,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-03 19:51:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:11,150 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:51:11,150 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:51:11,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:51:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:51:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-09-03 19:51:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:51:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 19:51:11,158 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-03 19:51:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:11,158 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 19:51:11,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:51:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 19:51:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:51:11,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:11,160 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:11,160 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1221539890, now seen corresponding path program 1 times [2019-09-03 19:51:11,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:51:11,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:11,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:11,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:51:11,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:11,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-03 19:51:11,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:51:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:51:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:11,431 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2019-09-03 19:51:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:11,593 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-03 19:51:11,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:51:11,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-03 19:51:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:11,597 INFO L225 Difference]: With dead ends: 81 [2019-09-03 19:51:11,597 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 19:51:11,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 19:51:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-09-03 19:51:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:51:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-03 19:51:11,612 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2019-09-03 19:51:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:11,613 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-03 19:51:11,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:51:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-03 19:51:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:51:11,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:11,615 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:11,615 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 754001880, now seen corresponding path program 2 times [2019-09-03 19:51:11,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:11,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:11,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:11,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:51:11,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:11,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:11,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:11,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:11,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:11,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:51:11,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:11,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2019-09-03 19:51:11,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:51:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:51:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:11,909 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 19 states. [2019-09-03 19:51:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:12,094 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2019-09-03 19:51:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:51:12,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-09-03 19:51:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:12,097 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:51:12,097 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:51:12,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:51:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2019-09-03 19:51:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-03 19:51:12,118 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 32 [2019-09-03 19:51:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:12,119 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-03 19:51:12,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:51:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-03 19:51:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:51:12,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:12,121 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:12,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash -678117305, now seen corresponding path program 3 times [2019-09-03 19:51:12,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-03 19:51:12,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:12,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:12,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:12,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:51:12,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:12,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:51:12,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-03 19:51:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:51:12,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:51:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:51:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:51:12,320 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 11 states. [2019-09-03 19:51:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:12,416 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2019-09-03 19:51:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:51:12,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-09-03 19:51:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:12,418 INFO L225 Difference]: With dead ends: 166 [2019-09-03 19:51:12,418 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:51:12,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:51:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 67. [2019-09-03 19:51:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:51:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-09-03 19:51:12,428 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 42 [2019-09-03 19:51:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:12,429 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-09-03 19:51:12,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:51:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-09-03 19:51:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:51:12,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:12,430 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:12,431 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -695540419, now seen corresponding path program 4 times [2019-09-03 19:51:12,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 19:51:12,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:12,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:12,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:12,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:12,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:12,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:12,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:12,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:12,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:12,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 26 [2019-09-03 19:51:12,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:51:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:51:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:12,816 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 26 states. [2019-09-03 19:51:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:13,001 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-09-03 19:51:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:51:13,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-09-03 19:51:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:13,003 INFO L225 Difference]: With dead ends: 195 [2019-09-03 19:51:13,003 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 19:51:13,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 19:51:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 99. [2019-09-03 19:51:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:51:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-09-03 19:51:13,012 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 42 [2019-09-03 19:51:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:13,013 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-09-03 19:51:13,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:51:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-09-03 19:51:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:13,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:13,015 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:13,015 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash -502075658, now seen corresponding path program 5 times [2019-09-03 19:51:13,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:13,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:51:13,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:13,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:13,175 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-03 19:51:13,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:13,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:51:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:13,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25] total 34 [2019-09-03 19:51:13,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:51:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:51:13,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:13,575 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 34 states. [2019-09-03 19:51:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:13,867 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2019-09-03 19:51:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:51:13,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-09-03 19:51:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:13,870 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:51:13,870 INFO L226 Difference]: Without dead ends: 241 [2019-09-03 19:51:13,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:51:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-03 19:51:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 136. [2019-09-03 19:51:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 19:51:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2019-09-03 19:51:13,884 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 56 [2019-09-03 19:51:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:13,885 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2019-09-03 19:51:13,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:51:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2019-09-03 19:51:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:13,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:13,887 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:13,888 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash -807774956, now seen corresponding path program 6 times [2019-09-03 19:51:13,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 19:51:14,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:14,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:14,102 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-03 19:51:14,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:14,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:14,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 19:51:14,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:14,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-03 19:51:14,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:51:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:51:14,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:14,159 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand 14 states. [2019-09-03 19:51:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:14,250 INFO L93 Difference]: Finished difference Result 478 states and 500 transitions. [2019-09-03 19:51:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:51:14,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-09-03 19:51:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:14,253 INFO L225 Difference]: With dead ends: 478 [2019-09-03 19:51:14,253 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 19:51:14,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 19:51:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 133. [2019-09-03 19:51:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 19:51:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-09-03 19:51:14,266 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 72 [2019-09-03 19:51:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:14,267 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-09-03 19:51:14,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:51:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-09-03 19:51:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:14,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:14,269 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:14,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1944217994, now seen corresponding path program 7 times [2019-09-03 19:51:14,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:14,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:51:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:14,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:14,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:14,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:51:14,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 33] total 44 [2019-09-03 19:51:14,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:51:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:51:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:14,965 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 44 states. [2019-09-03 19:51:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:15,384 INFO L93 Difference]: Finished difference Result 375 states and 423 transitions. [2019-09-03 19:51:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:51:15,384 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 72 [2019-09-03 19:51:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:15,388 INFO L225 Difference]: With dead ends: 375 [2019-09-03 19:51:15,389 INFO L226 Difference]: Without dead ends: 351 [2019-09-03 19:51:15,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:51:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-03 19:51:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 180. [2019-09-03 19:51:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:51:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2019-09-03 19:51:15,398 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 72 [2019-09-03 19:51:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:15,399 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2019-09-03 19:51:15,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:51:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2019-09-03 19:51:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:51:15,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:15,400 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:15,401 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash 280237874, now seen corresponding path program 8 times [2019-09-03 19:51:15,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-03 19:51:15,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:15,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:15,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:15,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:15,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:51:15,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:16,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:51:16,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:16,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 43] total 55 [2019-09-03 19:51:16,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:51:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:51:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:51:16,667 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand 55 states. [2019-09-03 19:51:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:17,246 INFO L93 Difference]: Finished difference Result 468 states and 528 transitions. [2019-09-03 19:51:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:51:17,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 92 [2019-09-03 19:51:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:17,251 INFO L225 Difference]: With dead ends: 468 [2019-09-03 19:51:17,251 INFO L226 Difference]: Without dead ends: 442 [2019-09-03 19:51:17,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:51:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-03 19:51:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 232. [2019-09-03 19:51:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-03 19:51:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-09-03 19:51:17,264 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 92 [2019-09-03 19:51:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:17,265 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-09-03 19:51:17,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:51:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-09-03 19:51:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:51:17,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:17,270 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:17,270 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash -813111489, now seen corresponding path program 9 times [2019-09-03 19:51:17,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:17,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-03 19:51:17,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:17,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:17,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 19:51:17,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:17,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-03 19:51:17,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:17,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-03 19:51:17,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:51:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:51:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:51:17,585 INFO L87 Difference]: Start difference. First operand 232 states and 272 transitions. Second operand 17 states. [2019-09-03 19:51:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:17,688 INFO L93 Difference]: Finished difference Result 1096 states and 1136 transitions. [2019-09-03 19:51:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:17,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2019-09-03 19:51:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:17,693 INFO L225 Difference]: With dead ends: 1096 [2019-09-03 19:51:17,693 INFO L226 Difference]: Without dead ends: 1090 [2019-09-03 19:51:17,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:51:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-03 19:51:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 229. [2019-09-03 19:51:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 19:51:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 268 transitions. [2019-09-03 19:51:17,707 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 268 transitions. Word has length 114 [2019-09-03 19:51:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:17,707 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 268 transitions. [2019-09-03 19:51:17,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:51:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 268 transitions. [2019-09-03 19:51:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:51:17,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:17,710 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:17,710 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1403958475, now seen corresponding path program 10 times [2019-09-03 19:51:17,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:17,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-03 19:51:17,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:17,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:17,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:17,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:19,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 1614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:19,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:19,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 54] total 68 [2019-09-03 19:51:19,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:51:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:51:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:19,361 INFO L87 Difference]: Start difference. First operand 229 states and 268 transitions. Second operand 68 states. [2019-09-03 19:51:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,276 INFO L93 Difference]: Finished difference Result 621 states and 696 transitions. [2019-09-03 19:51:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:51:20,277 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 114 [2019-09-03 19:51:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,280 INFO L225 Difference]: With dead ends: 621 [2019-09-03 19:51:20,280 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 19:51:20,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:51:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 19:51:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 291. [2019-09-03 19:51:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-03 19:51:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 342 transitions. [2019-09-03 19:51:20,295 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 342 transitions. Word has length 114 [2019-09-03 19:51:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,295 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 342 transitions. [2019-09-03 19:51:20,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:51:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 342 transitions. [2019-09-03 19:51:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:51:20,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,297 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,297 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -554968180, now seen corresponding path program 11 times [2019-09-03 19:51:20,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 19:51:20,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:20,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-03 19:51:20,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:20,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:51:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:22,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:22,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 67] total 82 [2019-09-03 19:51:22,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:51:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:51:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:51:22,323 INFO L87 Difference]: Start difference. First operand 291 states and 342 transitions. Second operand 82 states. [2019-09-03 19:51:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:23,637 INFO L93 Difference]: Finished difference Result 741 states and 831 transitions. [2019-09-03 19:51:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:51:23,638 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 140 [2019-09-03 19:51:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:23,641 INFO L225 Difference]: With dead ends: 741 [2019-09-03 19:51:23,641 INFO L226 Difference]: Without dead ends: 709 [2019-09-03 19:51:23,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:51:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-03 19:51:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 358. [2019-09-03 19:51:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-03 19:51:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 422 transitions. [2019-09-03 19:51:23,658 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 422 transitions. Word has length 140 [2019-09-03 19:51:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:23,658 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 422 transitions. [2019-09-03 19:51:23,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:51:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 422 transitions. [2019-09-03 19:51:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 19:51:23,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:23,661 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:23,661 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash -161368504, now seen corresponding path program 12 times [2019-09-03 19:51:23,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:23,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4214 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-03 19:51:23,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:23,885 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:23,944 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-03 19:51:23,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:23,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4214 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-03 19:51:24,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:24,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-03 19:51:24,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:51:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:51:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:24,018 INFO L87 Difference]: Start difference. First operand 358 states and 422 transitions. Second operand 20 states. [2019-09-03 19:51:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:24,128 INFO L93 Difference]: Finished difference Result 2128 states and 2192 transitions. [2019-09-03 19:51:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:51:24,129 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 168 [2019-09-03 19:51:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:24,137 INFO L225 Difference]: With dead ends: 2128 [2019-09-03 19:51:24,137 INFO L226 Difference]: Without dead ends: 2122 [2019-09-03 19:51:24,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-03 19:51:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 355. [2019-09-03 19:51:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-03 19:51:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 418 transitions. [2019-09-03 19:51:24,159 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 418 transitions. Word has length 168 [2019-09-03 19:51:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:24,159 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 418 transitions. [2019-09-03 19:51:24,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:51:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 418 transitions. [2019-09-03 19:51:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 19:51:24,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:24,162 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:24,162 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash -78591554, now seen corresponding path program 13 times [2019-09-03 19:51:24,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:24,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4116 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-03 19:51:24,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:24,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:24,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:24,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:51:24,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4116 backedges. 0 proven. 4116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:26,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:26,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 81] total 98 [2019-09-03 19:51:26,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 19:51:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 19:51:26,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:51:26,957 INFO L87 Difference]: Start difference. First operand 355 states and 418 transitions. Second operand 98 states. [2019-09-03 19:51:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:28,619 INFO L93 Difference]: Finished difference Result 933 states and 1041 transitions. [2019-09-03 19:51:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:51:28,620 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 168 [2019-09-03 19:51:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:28,626 INFO L225 Difference]: With dead ends: 933 [2019-09-03 19:51:28,626 INFO L226 Difference]: Without dead ends: 897 [2019-09-03 19:51:28,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:51:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-03 19:51:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 432. [2019-09-03 19:51:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-03 19:51:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 510 transitions. [2019-09-03 19:51:28,641 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 510 transitions. Word has length 168 [2019-09-03 19:51:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:28,641 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 510 transitions. [2019-09-03 19:51:28,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 19:51:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 510 transitions. [2019-09-03 19:51:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 19:51:28,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:28,644 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:28,644 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1423081476, now seen corresponding path program 14 times [2019-09-03 19:51:28,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6246 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-03 19:51:28,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:28,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:28,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:28,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:28,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:51:28,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6246 backedges. 0 proven. 6246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:32,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:32,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 97] total 115 [2019-09-03 19:51:32,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:51:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:51:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6115, Invalid=6995, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:51:32,312 INFO L87 Difference]: Start difference. First operand 432 states and 510 transitions. Second operand 115 states. [2019-09-03 19:51:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:34,770 INFO L93 Difference]: Finished difference Result 1080 states and 1206 transitions. [2019-09-03 19:51:34,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 19:51:34,770 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 200 [2019-09-03 19:51:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:34,775 INFO L225 Difference]: With dead ends: 1080 [2019-09-03 19:51:34,775 INFO L226 Difference]: Without dead ends: 1042 [2019-09-03 19:51:34,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6121, Invalid=7219, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:51:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-09-03 19:51:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 514. [2019-09-03 19:51:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-03 19:51:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 608 transitions. [2019-09-03 19:51:34,791 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 608 transitions. Word has length 200 [2019-09-03 19:51:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:34,791 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 608 transitions. [2019-09-03 19:51:34,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:51:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 608 transitions. [2019-09-03 19:51:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 19:51:34,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:34,795 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:34,795 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:34,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1244465839, now seen corresponding path program 15 times [2019-09-03 19:51:34,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9014 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-03 19:51:35,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:35,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:35,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:35,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 19:51:35,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:35,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:51:35,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:35,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9014 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-03 19:51:35,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:35,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-03 19:51:35,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:51:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:51:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:51:35,240 INFO L87 Difference]: Start difference. First operand 514 states and 608 transitions. Second operand 23 states. [2019-09-03 19:51:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:35,415 INFO L93 Difference]: Finished difference Result 3682 states and 3776 transitions. [2019-09-03 19:51:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:51:35,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 234 [2019-09-03 19:51:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:35,429 INFO L225 Difference]: With dead ends: 3682 [2019-09-03 19:51:35,429 INFO L226 Difference]: Without dead ends: 3676 [2019-09-03 19:51:35,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2019-09-03 19:51:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 511. [2019-09-03 19:51:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-03 19:51:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 604 transitions. [2019-09-03 19:51:35,457 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 604 transitions. Word has length 234 [2019-09-03 19:51:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:35,458 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 604 transitions. [2019-09-03 19:51:35,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:51:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 604 transitions. [2019-09-03 19:51:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 19:51:35,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:35,461 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:35,462 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash 409021861, now seen corresponding path program 16 times [2019-09-03 19:51:35,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:35,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:35,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2019-09-03 19:51:35,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:35,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:35,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:35,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:35,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:51:35,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:39,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 0 proven. 8862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:39,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:39,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 114] total 123 [2019-09-03 19:51:39,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 19:51:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 19:51:39,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7031, Invalid=7975, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:51:39,505 INFO L87 Difference]: Start difference. First operand 511 states and 604 transitions. Second operand 123 states. [2019-09-03 19:51:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:42,735 INFO L93 Difference]: Finished difference Result 860 states and 985 transitions. [2019-09-03 19:51:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 19:51:42,736 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 234 [2019-09-03 19:51:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:42,741 INFO L225 Difference]: With dead ends: 860 [2019-09-03 19:51:42,741 INFO L226 Difference]: Without dead ends: 840 [2019-09-03 19:51:42,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7037, Invalid=8215, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:51:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-09-03 19:51:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 548. [2019-09-03 19:51:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-03 19:51:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 648 transitions. [2019-09-03 19:51:42,753 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 648 transitions. Word has length 234 [2019-09-03 19:51:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:42,754 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 648 transitions. [2019-09-03 19:51:42,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 19:51:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 648 transitions. [2019-09-03 19:51:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-03 19:51:42,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:42,758 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:42,758 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -243253949, now seen corresponding path program 17 times [2019-09-03 19:51:42,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10242 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:51:43,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:43,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:43,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:43,250 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:51:43,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:43,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:51:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10242 backedges. 0 proven. 10242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:47,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:47,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 122] total 124 [2019-09-03 19:51:47,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 19:51:47,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 19:51:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:51:47,191 INFO L87 Difference]: Start difference. First operand 548 states and 648 transitions. Second operand 124 states. [2019-09-03 19:51:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:49,687 INFO L93 Difference]: Finished difference Result 613 states and 732 transitions. [2019-09-03 19:51:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-03 19:51:49,688 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 250 [2019-09-03 19:51:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:49,691 INFO L225 Difference]: With dead ends: 613 [2019-09-03 19:51:49,691 INFO L226 Difference]: Without dead ends: 607 [2019-09-03 19:51:49,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4130 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:51:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-03 19:51:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 550. [2019-09-03 19:51:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-03 19:51:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 650 transitions. [2019-09-03 19:51:49,702 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 650 transitions. Word has length 250 [2019-09-03 19:51:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:49,702 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 650 transitions. [2019-09-03 19:51:49,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 19:51:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 650 transitions. [2019-09-03 19:51:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:51:49,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:49,706 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:49,706 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2131025886, now seen corresponding path program 18 times [2019-09-03 19:51:49,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:49,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:51:50,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:50,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:50,073 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:50,198 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-03 19:51:50,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:50,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:51:50,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:51:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:50,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-03 19:51:50,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:51:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:51:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:50,283 INFO L87 Difference]: Start difference. First operand 550 states and 650 transitions. Second operand 26 states. [2019-09-03 19:51:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:50,478 INFO L93 Difference]: Finished difference Result 4516 states and 4616 transitions. [2019-09-03 19:51:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:51:50,480 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 252 [2019-09-03 19:51:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:50,492 INFO L225 Difference]: With dead ends: 4516 [2019-09-03 19:51:50,492 INFO L226 Difference]: Without dead ends: 4510 [2019-09-03 19:51:50,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2019-09-03 19:51:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 547. [2019-09-03 19:51:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-03 19:51:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 646 transitions. [2019-09-03 19:51:50,515 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 646 transitions. Word has length 252 [2019-09-03 19:51:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:50,516 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 646 transitions. [2019-09-03 19:51:50,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:51:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 646 transitions. [2019-09-03 19:51:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:51:50,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:50,519 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:50,520 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1062498900, now seen corresponding path program 19 times [2019-09-03 19:51:50,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:50,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10122 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:51:50,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:50,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:50,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-03 19:51:50,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10122 backedges. 0 proven. 10122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:55,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:55,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 123] total 126 [2019-09-03 19:51:55,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 19:51:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 19:51:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 19:51:55,011 INFO L87 Difference]: Start difference. First operand 547 states and 646 transitions. Second operand 126 states. [2019-09-03 19:51:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:58,095 INFO L93 Difference]: Finished difference Result 665 states and 787 transitions. [2019-09-03 19:51:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 19:51:58,095 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 252 [2019-09-03 19:51:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:58,099 INFO L225 Difference]: With dead ends: 665 [2019-09-03 19:51:58,099 INFO L226 Difference]: Without dead ends: 657 [2019-09-03 19:51:58,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:51:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-03 19:51:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 554. [2019-09-03 19:51:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-03 19:51:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 654 transitions. [2019-09-03 19:51:58,109 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 654 transitions. Word has length 252 [2019-09-03 19:51:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:58,109 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 654 transitions. [2019-09-03 19:51:58,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 19:51:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 654 transitions. [2019-09-03 19:51:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 19:51:58,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:58,112 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:58,112 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash -589880108, now seen corresponding path program 20 times [2019-09-03 19:51:58,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:58,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10362 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:51:58,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:58,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:58,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:58,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:58,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-03 19:51:58,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:02,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10362 backedges. 0 proven. 10362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:02,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:02,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 125] total 127 [2019-09-03 19:52:02,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 19:52:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 19:52:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7513, Invalid=8489, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:52:02,540 INFO L87 Difference]: Start difference. First operand 554 states and 654 transitions. Second operand 127 states. [2019-09-03 19:52:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:05,580 INFO L93 Difference]: Finished difference Result 628 states and 750 transitions. [2019-09-03 19:52:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 19:52:05,581 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 256 [2019-09-03 19:52:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:05,585 INFO L225 Difference]: With dead ends: 628 [2019-09-03 19:52:05,585 INFO L226 Difference]: Without dead ends: 622 [2019-09-03 19:52:05,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7519, Invalid=8737, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:52:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-03 19:52:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 556. [2019-09-03 19:52:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-09-03 19:52:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 656 transitions. [2019-09-03 19:52:05,594 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 656 transitions. Word has length 256 [2019-09-03 19:52:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:05,595 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 656 transitions. [2019-09-03 19:52:05,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 19:52:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 656 transitions. [2019-09-03 19:52:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:52:05,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:05,598 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:05,598 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -264231121, now seen corresponding path program 21 times [2019-09-03 19:52:05,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:05,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:05,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:06,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:06,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 19:52:06,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:52:06,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:06,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:06,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:06,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-03 19:52:06,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:52:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:52:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:52:06,148 INFO L87 Difference]: Start difference. First operand 556 states and 656 transitions. Second operand 29 states. [2019-09-03 19:52:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:06,368 INFO L93 Difference]: Finished difference Result 5116 states and 5216 transitions. [2019-09-03 19:52:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:52:06,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 258 [2019-09-03 19:52:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:06,384 INFO L225 Difference]: With dead ends: 5116 [2019-09-03 19:52:06,384 INFO L226 Difference]: Without dead ends: 5110 [2019-09-03 19:52:06,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:52:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2019-09-03 19:52:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 553. [2019-09-03 19:52:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-03 19:52:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 652 transitions. [2019-09-03 19:52:06,408 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 652 transitions. Word has length 258 [2019-09-03 19:52:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:06,408 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 652 transitions. [2019-09-03 19:52:06,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:52:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 652 transitions. [2019-09-03 19:52:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:52:06,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:06,411 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:06,411 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1455847131, now seen corresponding path program 22 times [2019-09-03 19:52:06,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:06,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:06,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:06,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10254 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:52:06,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:06,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:07,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:07,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:07,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:52:07,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:10,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10254 backedges. 0 proven. 10254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:10,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:10,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 126] total 129 [2019-09-03 19:52:10,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 19:52:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 19:52:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7760, Invalid=8752, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:52:10,602 INFO L87 Difference]: Start difference. First operand 553 states and 652 transitions. Second operand 129 states. [2019-09-03 19:52:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:13,854 INFO L93 Difference]: Finished difference Result 686 states and 811 transitions. [2019-09-03 19:52:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 19:52:13,858 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 258 [2019-09-03 19:52:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:13,861 INFO L225 Difference]: With dead ends: 686 [2019-09-03 19:52:13,861 INFO L226 Difference]: Without dead ends: 678 [2019-09-03 19:52:13,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5140 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7766, Invalid=9004, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:52:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-03 19:52:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 560. [2019-09-03 19:52:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-03 19:52:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 660 transitions. [2019-09-03 19:52:13,869 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 660 transitions. Word has length 258 [2019-09-03 19:52:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:13,870 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 660 transitions. [2019-09-03 19:52:13,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 19:52:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 660 transitions. [2019-09-03 19:52:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 19:52:13,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:13,872 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:13,872 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 629955493, now seen corresponding path program 23 times [2019-09-03 19:52:13,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10500 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:14,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:14,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:14,489 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:14,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:52:14,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:14,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:52:14,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:18,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10500 backedges. 0 proven. 10500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 128] total 130 [2019-09-03 19:52:18,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 19:52:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 19:52:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:52:18,665 INFO L87 Difference]: Start difference. First operand 560 states and 660 transitions. Second operand 130 states. [2019-09-03 19:52:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:21,922 INFO L93 Difference]: Finished difference Result 643 states and 768 transitions. [2019-09-03 19:52:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 19:52:21,922 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 262 [2019-09-03 19:52:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:21,924 INFO L225 Difference]: With dead ends: 643 [2019-09-03 19:52:21,924 INFO L226 Difference]: Without dead ends: 637 [2019-09-03 19:52:21,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5342 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:52:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-03 19:52:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 562. [2019-09-03 19:52:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-03 19:52:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 662 transitions. [2019-09-03 19:52:21,932 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 662 transitions. Word has length 262 [2019-09-03 19:52:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:21,932 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 662 transitions. [2019-09-03 19:52:21,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 19:52:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 662 transitions. [2019-09-03 19:52:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 19:52:21,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:21,935 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:21,935 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -528290368, now seen corresponding path program 24 times [2019-09-03 19:52:21,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:21,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10550 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:22,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:22,505 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-09-03 19:52:22,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:22,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:52:22,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:22,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10550 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:22,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-03 19:52:22,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:52:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:52:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:52:22,577 INFO L87 Difference]: Start difference. First operand 562 states and 662 transitions. Second operand 32 states. [2019-09-03 19:52:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:22,778 INFO L93 Difference]: Finished difference Result 5716 states and 5816 transitions. [2019-09-03 19:52:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:52:22,778 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 264 [2019-09-03 19:52:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:22,796 INFO L225 Difference]: With dead ends: 5716 [2019-09-03 19:52:22,796 INFO L226 Difference]: Without dead ends: 5710 [2019-09-03 19:52:22,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2019-09-03 19:52:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 559. [2019-09-03 19:52:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-03 19:52:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 658 transitions. [2019-09-03 19:52:22,822 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 658 transitions. Word has length 264 [2019-09-03 19:52:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:22,822 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 658 transitions. [2019-09-03 19:52:22,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:52:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 658 transitions. [2019-09-03 19:52:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 19:52:22,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:22,824 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:22,825 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:22,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1282178870, now seen corresponding path program 25 times [2019-09-03 19:52:22,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:22,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:22,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:52:23,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:23,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-03 19:52:23,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:27,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:27,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 129] total 132 [2019-09-03 19:52:27,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 19:52:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 19:52:27,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:52:27,265 INFO L87 Difference]: Start difference. First operand 559 states and 658 transitions. Second operand 132 states. [2019-09-03 19:52:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:30,719 INFO L93 Difference]: Finished difference Result 707 states and 835 transitions. [2019-09-03 19:52:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-03 19:52:30,719 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 264 [2019-09-03 19:52:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:30,723 INFO L225 Difference]: With dead ends: 707 [2019-09-03 19:52:30,724 INFO L226 Difference]: Without dead ends: 699 [2019-09-03 19:52:30,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5746 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:52:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-03 19:52:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 566. [2019-09-03 19:52:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-03 19:52:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 666 transitions. [2019-09-03 19:52:30,732 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 666 transitions. Word has length 264 [2019-09-03 19:52:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:30,732 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 666 transitions. [2019-09-03 19:52:30,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 19:52:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 666 transitions. [2019-09-03 19:52:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 19:52:30,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:30,735 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:30,735 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 318206390, now seen corresponding path program 26 times [2019-09-03 19:52:30,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:30,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:31,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:31,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:31,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:31,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:31,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:31,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 19:52:31,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:35,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:35,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 131] total 133 [2019-09-03 19:52:35,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 19:52:35,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 19:52:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8266, Invalid=9290, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:52:35,119 INFO L87 Difference]: Start difference. First operand 566 states and 666 transitions. Second operand 133 states. [2019-09-03 19:52:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:38,539 INFO L93 Difference]: Finished difference Result 658 states and 786 transitions. [2019-09-03 19:52:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 19:52:38,540 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 268 [2019-09-03 19:52:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:38,542 INFO L225 Difference]: With dead ends: 658 [2019-09-03 19:52:38,542 INFO L226 Difference]: Without dead ends: 652 [2019-09-03 19:52:38,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5948 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8272, Invalid=9550, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 19:52:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-03 19:52:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 568. [2019-09-03 19:52:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-03 19:52:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 668 transitions. [2019-09-03 19:52:38,551 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 668 transitions. Word has length 268 [2019-09-03 19:52:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:38,551 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 668 transitions. [2019-09-03 19:52:38,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 19:52:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 668 transitions. [2019-09-03 19:52:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 19:52:38,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:38,553 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:38,554 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 528532369, now seen corresponding path program 27 times [2019-09-03 19:52:38,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:38,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:39,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:39,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:39,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:39,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 19:52:39,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:39,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:52:39,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:39,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:39,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:39,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-03 19:52:39,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:52:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:52:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:52:39,216 INFO L87 Difference]: Start difference. First operand 568 states and 668 transitions. Second operand 35 states. [2019-09-03 19:52:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:39,482 INFO L93 Difference]: Finished difference Result 6316 states and 6416 transitions. [2019-09-03 19:52:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:52:39,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 270 [2019-09-03 19:52:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:39,491 INFO L225 Difference]: With dead ends: 6316 [2019-09-03 19:52:39,491 INFO L226 Difference]: Without dead ends: 6310 [2019-09-03 19:52:39,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:52:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2019-09-03 19:52:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 565. [2019-09-03 19:52:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-03 19:52:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 664 transitions. [2019-09-03 19:52:39,522 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 664 transitions. Word has length 270 [2019-09-03 19:52:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 664 transitions. [2019-09-03 19:52:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:52:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 664 transitions. [2019-09-03 19:52:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 19:52:39,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:39,525 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:39,525 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash 39380103, now seen corresponding path program 28 times [2019-09-03 19:52:39,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:39,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:39,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:39,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10572 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:52:40,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:40,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:40,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:40,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:40,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 19:52:40,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10572 backedges. 0 proven. 10572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:43,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:43,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 132] total 135 [2019-09-03 19:52:43,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 19:52:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 19:52:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8525, Invalid=9565, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 19:52:43,930 INFO L87 Difference]: Start difference. First operand 565 states and 664 transitions. Second operand 135 states. [2019-09-03 19:52:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:47,811 INFO L93 Difference]: Finished difference Result 728 states and 859 transitions. [2019-09-03 19:52:47,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 19:52:47,811 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 270 [2019-09-03 19:52:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:47,814 INFO L225 Difference]: With dead ends: 728 [2019-09-03 19:52:47,814 INFO L226 Difference]: Without dead ends: 720 [2019-09-03 19:52:47,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6352 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8531, Invalid=9829, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:52:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-09-03 19:52:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 572. [2019-09-03 19:52:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-03 19:52:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 672 transitions. [2019-09-03 19:52:47,823 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 672 transitions. Word has length 270 [2019-09-03 19:52:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:47,823 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 672 transitions. [2019-09-03 19:52:47,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 19:52:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 672 transitions. [2019-09-03 19:52:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-03 19:52:47,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:47,826 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:47,826 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1350825735, now seen corresponding path program 29 times [2019-09-03 19:52:47,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10830 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:48,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:48,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:48,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:48,754 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:52:48,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:48,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 19:52:48,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:52,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10830 backedges. 0 proven. 10830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:52:52,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:52,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 134] total 136 [2019-09-03 19:52:52,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 19:52:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 19:52:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:52:52,408 INFO L87 Difference]: Start difference. First operand 572 states and 672 transitions. Second operand 136 states. [2019-09-03 19:52:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:56,444 INFO L93 Difference]: Finished difference Result 673 states and 804 transitions. [2019-09-03 19:52:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 19:52:56,445 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 274 [2019-09-03 19:52:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:56,446 INFO L225 Difference]: With dead ends: 673 [2019-09-03 19:52:56,447 INFO L226 Difference]: Without dead ends: 667 [2019-09-03 19:52:56,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 19:52:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-09-03 19:52:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 574. [2019-09-03 19:52:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-03 19:52:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 674 transitions. [2019-09-03 19:52:56,454 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 674 transitions. Word has length 274 [2019-09-03 19:52:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:56,454 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 674 transitions. [2019-09-03 19:52:56,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 19:52:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 674 transitions. [2019-09-03 19:52:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 19:52:56,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:56,456 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:56,457 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 738277538, now seen corresponding path program 30 times [2019-09-03 19:52:56,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10892 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:57,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:57,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:57,026 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:57,169 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-03 19:52:57,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:57,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:52:57,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:57,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10892 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:52:57,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-03 19:52:57,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:52:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:52:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:57,281 INFO L87 Difference]: Start difference. First operand 574 states and 674 transitions. Second operand 38 states. [2019-09-03 19:52:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:57,522 INFO L93 Difference]: Finished difference Result 6916 states and 7016 transitions. [2019-09-03 19:52:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:52:57,523 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 276 [2019-09-03 19:52:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:57,530 INFO L225 Difference]: With dead ends: 6916 [2019-09-03 19:52:57,531 INFO L226 Difference]: Without dead ends: 6910 [2019-09-03 19:52:57,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:52:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6910 states. [2019-09-03 19:52:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6910 to 571. [2019-09-03 19:52:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-03 19:52:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 670 transitions. [2019-09-03 19:52:57,575 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 670 transitions. Word has length 276 [2019-09-03 19:52:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:57,575 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 670 transitions. [2019-09-03 19:52:57,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:52:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 670 transitions. [2019-09-03 19:52:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 19:52:57,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:57,578 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:57,578 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 696142104, now seen corresponding path program 31 times [2019-09-03 19:52:57,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10758 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:52:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:58,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:58,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-03 19:52:58,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:01,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10758 backedges. 0 proven. 10758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:01,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:01,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 135] total 138 [2019-09-03 19:53:01,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 19:53:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 19:53:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:53:01,886 INFO L87 Difference]: Start difference. First operand 571 states and 670 transitions. Second operand 138 states. [2019-09-03 19:53:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:05,748 INFO L93 Difference]: Finished difference Result 749 states and 883 transitions. [2019-09-03 19:53:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 19:53:05,749 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 276 [2019-09-03 19:53:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:05,751 INFO L225 Difference]: With dead ends: 749 [2019-09-03 19:53:05,751 INFO L226 Difference]: Without dead ends: 741 [2019-09-03 19:53:05,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6958 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 19:53:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-03 19:53:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 578. [2019-09-03 19:53:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-03 19:53:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 678 transitions. [2019-09-03 19:53:05,759 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 678 transitions. Word has length 276 [2019-09-03 19:53:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:05,760 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 678 transitions. [2019-09-03 19:53:05,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 19:53:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 678 transitions. [2019-09-03 19:53:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-03 19:53:05,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:05,762 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:05,762 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1900971112, now seen corresponding path program 32 times [2019-09-03 19:53:05,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:05,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:05,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:05,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11022 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:06,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:06,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:06,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:06,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:06,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 19:53:06,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:09,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11022 backedges. 0 proven. 11022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:10,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:10,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 137] total 139 [2019-09-03 19:53:10,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 19:53:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 19:53:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9055, Invalid=10127, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 19:53:10,019 INFO L87 Difference]: Start difference. First operand 578 states and 678 transitions. Second operand 139 states. [2019-09-03 19:53:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:13,694 INFO L93 Difference]: Finished difference Result 688 states and 822 transitions. [2019-09-03 19:53:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 19:53:13,695 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 280 [2019-09-03 19:53:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:13,697 INFO L225 Difference]: With dead ends: 688 [2019-09-03 19:53:13,697 INFO L226 Difference]: Without dead ends: 682 [2019-09-03 19:53:13,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7160 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9061, Invalid=10399, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 19:53:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-03 19:53:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 580. [2019-09-03 19:53:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-03 19:53:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 680 transitions. [2019-09-03 19:53:13,705 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 680 transitions. Word has length 280 [2019-09-03 19:53:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:13,705 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 680 transitions. [2019-09-03 19:53:13,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 19:53:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 680 transitions. [2019-09-03 19:53:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-03 19:53:13,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:13,708 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:13,708 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1797268237, now seen corresponding path program 33 times [2019-09-03 19:53:13,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:14,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:14,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:14,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 19:53:14,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:14,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:53:14,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:14,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:14,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-03 19:53:14,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:53:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:53:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:53:14,523 INFO L87 Difference]: Start difference. First operand 580 states and 680 transitions. Second operand 41 states. [2019-09-03 19:53:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:14,814 INFO L93 Difference]: Finished difference Result 7516 states and 7616 transitions. [2019-09-03 19:53:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:53:14,814 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 282 [2019-09-03 19:53:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:14,822 INFO L225 Difference]: With dead ends: 7516 [2019-09-03 19:53:14,822 INFO L226 Difference]: Without dead ends: 7510 [2019-09-03 19:53:14,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:53:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2019-09-03 19:53:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 577. [2019-09-03 19:53:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-03 19:53:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 676 transitions. [2019-09-03 19:53:14,855 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 676 transitions. Word has length 282 [2019-09-03 19:53:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:14,855 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 676 transitions. [2019-09-03 19:53:14,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:53:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 676 transitions. [2019-09-03 19:53:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-03 19:53:14,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:14,858 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:14,858 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:14,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2039464727, now seen corresponding path program 34 times [2019-09-03 19:53:14,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:14,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:14,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:53:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:15,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:15,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:15,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:15,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 19:53:15,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:19,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 0 proven. 10962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:19,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:19,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 138] total 141 [2019-09-03 19:53:19,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 19:53:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 19:53:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9326, Invalid=10414, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 19:53:19,267 INFO L87 Difference]: Start difference. First operand 577 states and 676 transitions. Second operand 141 states. [2019-09-03 19:53:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:23,053 INFO L93 Difference]: Finished difference Result 770 states and 907 transitions. [2019-09-03 19:53:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 19:53:23,054 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 282 [2019-09-03 19:53:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:23,056 INFO L225 Difference]: With dead ends: 770 [2019-09-03 19:53:23,056 INFO L226 Difference]: Without dead ends: 762 [2019-09-03 19:53:23,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=9332, Invalid=10690, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 19:53:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-03 19:53:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 584. [2019-09-03 19:53:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-03 19:53:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 684 transitions. [2019-09-03 19:53:23,063 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 684 transitions. Word has length 282 [2019-09-03 19:53:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:23,064 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 684 transitions. [2019-09-03 19:53:23,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 19:53:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 684 transitions. [2019-09-03 19:53:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 19:53:23,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:23,066 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:23,066 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1679003497, now seen corresponding path program 35 times [2019-09-03 19:53:23,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:23,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:23,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:23,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:23,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:53:23,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:23,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 19:53:23,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:27,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 0 proven. 11232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:27,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 140] total 142 [2019-09-03 19:53:27,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 19:53:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 19:53:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 19:53:27,674 INFO L87 Difference]: Start difference. First operand 584 states and 684 transitions. Second operand 142 states. [2019-09-03 19:53:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:31,846 INFO L93 Difference]: Finished difference Result 703 states and 840 transitions. [2019-09-03 19:53:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 19:53:31,846 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 286 [2019-09-03 19:53:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:31,848 INFO L225 Difference]: With dead ends: 703 [2019-09-03 19:53:31,848 INFO L226 Difference]: Without dead ends: 697 [2019-09-03 19:53:31,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7766 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 19:53:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-03 19:53:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 586. [2019-09-03 19:53:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-03 19:53:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 686 transitions. [2019-09-03 19:53:31,856 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 686 transitions. Word has length 286 [2019-09-03 19:53:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:31,856 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 686 transitions. [2019-09-03 19:53:31,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 19:53:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 686 transitions. [2019-09-03 19:53:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-03 19:53:31,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:31,858 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:31,859 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1710473084, now seen corresponding path program 36 times [2019-09-03 19:53:31,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:31,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11306 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:32,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:32,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2019-09-03 19:53:32,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:32,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:53:32,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11306 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:32,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-03 19:53:32,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:53:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:53:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:32,827 INFO L87 Difference]: Start difference. First operand 586 states and 686 transitions. Second operand 44 states. [2019-09-03 19:53:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:33,141 INFO L93 Difference]: Finished difference Result 8116 states and 8216 transitions. [2019-09-03 19:53:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:53:33,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 288 [2019-09-03 19:53:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:33,147 INFO L225 Difference]: With dead ends: 8116 [2019-09-03 19:53:33,148 INFO L226 Difference]: Without dead ends: 8110 [2019-09-03 19:53:33,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:53:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states. [2019-09-03 19:53:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 583. [2019-09-03 19:53:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-03 19:53:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 682 transitions. [2019-09-03 19:53:33,182 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 682 transitions. Word has length 288 [2019-09-03 19:53:33,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:33,182 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 682 transitions. [2019-09-03 19:53:33,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:53:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 682 transitions. [2019-09-03 19:53:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-03 19:53:33,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:33,184 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:33,184 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1691766778, now seen corresponding path program 37 times [2019-09-03 19:53:33,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:33,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:53:33,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:33,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:34,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 19:53:34,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:37,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 0 proven. 11184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:37,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 141] total 144 [2019-09-03 19:53:37,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 19:53:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 19:53:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 19:53:37,651 INFO L87 Difference]: Start difference. First operand 583 states and 682 transitions. Second operand 144 states. [2019-09-03 19:53:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,631 INFO L93 Difference]: Finished difference Result 791 states and 931 transitions. [2019-09-03 19:53:42,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 19:53:42,631 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 288 [2019-09-03 19:53:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,633 INFO L225 Difference]: With dead ends: 791 [2019-09-03 19:53:42,633 INFO L226 Difference]: Without dead ends: 783 [2019-09-03 19:53:42,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8170 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 19:53:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-03 19:53:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 590. [2019-09-03 19:53:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-03 19:53:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 690 transitions. [2019-09-03 19:53:42,639 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 690 transitions. Word has length 288 [2019-09-03 19:53:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,639 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 690 transitions. [2019-09-03 19:53:42,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 19:53:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 690 transitions. [2019-09-03 19:53:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 19:53:42,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,641 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,642 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1850851962, now seen corresponding path program 38 times [2019-09-03 19:53:42,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:42,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11460 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:43,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:43,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:43,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11460 backedges. 0 proven. 11460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:47,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 143] total 145 [2019-09-03 19:53:47,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 19:53:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 19:53:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9880, Invalid=11000, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 19:53:47,194 INFO L87 Difference]: Start difference. First operand 590 states and 690 transitions. Second operand 145 states. [2019-09-03 19:53:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:51,412 INFO L93 Difference]: Finished difference Result 718 states and 858 transitions. [2019-09-03 19:53:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 19:53:51,413 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 292 [2019-09-03 19:53:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:51,414 INFO L225 Difference]: With dead ends: 718 [2019-09-03 19:53:51,414 INFO L226 Difference]: Without dead ends: 712 [2019-09-03 19:53:51,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9886, Invalid=11284, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 19:53:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-03 19:53:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 592. [2019-09-03 19:53:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-03 19:53:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 692 transitions. [2019-09-03 19:53:51,420 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 692 transitions. Word has length 292 [2019-09-03 19:53:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:51,420 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 692 transitions. [2019-09-03 19:53:51,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 19:53:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 692 transitions. [2019-09-03 19:53:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 19:53:51,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:51,422 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:51,422 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash 227144533, now seen corresponding path program 39 times [2019-09-03 19:53:51,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:51,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11540 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:52,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:52,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:52,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 19:53:52,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:52,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:53:52,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:52,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11540 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:53:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-03 19:53:52,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:53:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:53:52,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:53:52,447 INFO L87 Difference]: Start difference. First operand 592 states and 692 transitions. Second operand 47 states. [2019-09-03 19:53:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:52,860 INFO L93 Difference]: Finished difference Result 8716 states and 8816 transitions. [2019-09-03 19:53:52,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:53:52,861 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 294 [2019-09-03 19:53:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:52,867 INFO L225 Difference]: With dead ends: 8716 [2019-09-03 19:53:52,868 INFO L226 Difference]: Without dead ends: 8710 [2019-09-03 19:53:52,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:53:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-09-03 19:53:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 589. [2019-09-03 19:53:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-03 19:53:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 688 transitions. [2019-09-03 19:53:52,898 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 688 transitions. Word has length 294 [2019-09-03 19:53:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:52,898 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 688 transitions. [2019-09-03 19:53:52,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:53:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 688 transitions. [2019-09-03 19:53:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 19:53:52,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:52,901 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:52,901 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash -127135157, now seen corresponding path program 40 times [2019-09-03 19:53:52,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11424 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:53:53,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:54,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:54,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:54,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 19:53:54,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:57,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11424 backedges. 0 proven. 11424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:57,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 144] total 147 [2019-09-03 19:53:57,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 19:53:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 19:53:57,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10163, Invalid=11299, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 19:53:57,711 INFO L87 Difference]: Start difference. First operand 589 states and 688 transitions. Second operand 147 states. [2019-09-03 19:54:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:02,476 INFO L93 Difference]: Finished difference Result 812 states and 955 transitions. [2019-09-03 19:54:02,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 19:54:02,477 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 294 [2019-09-03 19:54:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:02,478 INFO L225 Difference]: With dead ends: 812 [2019-09-03 19:54:02,479 INFO L226 Difference]: Without dead ends: 804 [2019-09-03 19:54:02,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8776 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10169, Invalid=11587, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:54:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-09-03 19:54:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 596. [2019-09-03 19:54:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-03 19:54:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 696 transitions. [2019-09-03 19:54:02,486 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 696 transitions. Word has length 294 [2019-09-03 19:54:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:02,486 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 696 transitions. [2019-09-03 19:54:02,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 19:54:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 696 transitions. [2019-09-03 19:54:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-03 19:54:02,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:02,489 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:02,489 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1289247541, now seen corresponding path program 41 times [2019-09-03 19:54:02,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:02,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11706 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:03,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:03,587 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:54:03,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:03,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 19:54:03,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11706 backedges. 0 proven. 11706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:07,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:07,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 146] total 148 [2019-09-03 19:54:07,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 19:54:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 19:54:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10306, Invalid=11450, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:54:07,197 INFO L87 Difference]: Start difference. First operand 596 states and 696 transitions. Second operand 148 states. [2019-09-03 19:54:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:12,829 INFO L93 Difference]: Finished difference Result 733 states and 876 transitions. [2019-09-03 19:54:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-03 19:54:12,830 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 298 [2019-09-03 19:54:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:12,831 INFO L225 Difference]: With dead ends: 733 [2019-09-03 19:54:12,831 INFO L226 Difference]: Without dead ends: 727 [2019-09-03 19:54:12,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8978 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=10312, Invalid=11740, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 19:54:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-03 19:54:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 598. [2019-09-03 19:54:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-03 19:54:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 698 transitions. [2019-09-03 19:54:12,837 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 698 transitions. Word has length 298 [2019-09-03 19:54:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:12,838 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 698 transitions. [2019-09-03 19:54:12,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 19:54:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 698 transitions. [2019-09-03 19:54:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 19:54:12,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:12,839 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:12,839 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1953531238, now seen corresponding path program 42 times [2019-09-03 19:54:12,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:12,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:12,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11792 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:13,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:13,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:14,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-09-03 19:54:14,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:14,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:54:14,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11792 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:14,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-03 19:54:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:54:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:54:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:54:14,115 INFO L87 Difference]: Start difference. First operand 598 states and 698 transitions. Second operand 50 states. [2019-09-03 19:54:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:14,583 INFO L93 Difference]: Finished difference Result 9316 states and 9416 transitions. [2019-09-03 19:54:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:54:14,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 300 [2019-09-03 19:54:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:14,590 INFO L225 Difference]: With dead ends: 9316 [2019-09-03 19:54:14,590 INFO L226 Difference]: Without dead ends: 9310 [2019-09-03 19:54:14,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:54:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9310 states. [2019-09-03 19:54:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9310 to 595. [2019-09-03 19:54:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-03 19:54:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 694 transitions. [2019-09-03 19:54:14,624 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 694 transitions. Word has length 300 [2019-09-03 19:54:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:14,625 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 694 transitions. [2019-09-03 19:54:14,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:54:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 694 transitions. [2019-09-03 19:54:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 19:54:14,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:14,627 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:14,627 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -33483812, now seen corresponding path program 43 times [2019-09-03 19:54:14,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:14,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:14,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:14,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:54:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:15,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 19:54:15,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 0 proven. 11682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:19,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:19,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 147] total 150 [2019-09-03 19:54:19,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 19:54:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 19:54:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10595, Invalid=11755, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 19:54:19,294 INFO L87 Difference]: Start difference. First operand 595 states and 694 transitions. Second operand 150 states. [2019-09-03 19:54:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:25,072 INFO L93 Difference]: Finished difference Result 833 states and 979 transitions. [2019-09-03 19:54:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 19:54:25,073 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 300 [2019-09-03 19:54:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:25,074 INFO L225 Difference]: With dead ends: 833 [2019-09-03 19:54:25,074 INFO L226 Difference]: Without dead ends: 825 [2019-09-03 19:54:25,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9382 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=10601, Invalid=12049, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 19:54:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-09-03 19:54:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 602. [2019-09-03 19:54:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-03 19:54:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 702 transitions. [2019-09-03 19:54:25,080 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 702 transitions. Word has length 300 [2019-09-03 19:54:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:25,080 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 702 transitions. [2019-09-03 19:54:25,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 19:54:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 702 transitions. [2019-09-03 19:54:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-03 19:54:25,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:25,082 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:25,082 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1097123420, now seen corresponding path program 44 times [2019-09-03 19:54:25,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:25,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:26,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:26,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:26,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:26,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:26,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:26,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 19:54:26,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:29,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:29,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 149] total 151 [2019-09-03 19:54:29,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 19:54:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 19:54:29,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10741, Invalid=11909, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 19:54:29,805 INFO L87 Difference]: Start difference. First operand 602 states and 702 transitions. Second operand 151 states. [2019-09-03 19:54:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:35,539 INFO L93 Difference]: Finished difference Result 748 states and 894 transitions. [2019-09-03 19:54:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 19:54:35,539 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 304 [2019-09-03 19:54:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:35,540 INFO L225 Difference]: With dead ends: 748 [2019-09-03 19:54:35,540 INFO L226 Difference]: Without dead ends: 742 [2019-09-03 19:54:35,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9584 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10747, Invalid=12205, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 19:54:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-03 19:54:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 604. [2019-09-03 19:54:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-03 19:54:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 704 transitions. [2019-09-03 19:54:35,547 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 704 transitions. Word has length 304 [2019-09-03 19:54:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:35,547 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 704 transitions. [2019-09-03 19:54:35,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 19:54:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 704 transitions. [2019-09-03 19:54:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 19:54:35,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:35,549 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:35,549 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:35,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1743488695, now seen corresponding path program 45 times [2019-09-03 19:54:35,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:35,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:35,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:35,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12062 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:37,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:37,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:37,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-03 19:54:37,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:37,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:54:37,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12062 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:54:37,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:37,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-03 19:54:37,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:54:37,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:54:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:54:37,410 INFO L87 Difference]: Start difference. First operand 604 states and 704 transitions. Second operand 53 states. [2019-09-03 19:54:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:37,913 INFO L93 Difference]: Finished difference Result 9916 states and 10016 transitions. [2019-09-03 19:54:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:54:37,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 306 [2019-09-03 19:54:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:37,921 INFO L225 Difference]: With dead ends: 9916 [2019-09-03 19:54:37,921 INFO L226 Difference]: Without dead ends: 9910 [2019-09-03 19:54:37,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:54:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9910 states. [2019-09-03 19:54:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9910 to 601. [2019-09-03 19:54:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-03 19:54:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 700 transitions. [2019-09-03 19:54:37,951 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 700 transitions. Word has length 306 [2019-09-03 19:54:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:37,951 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 700 transitions. [2019-09-03 19:54:37,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:54:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 700 transitions. [2019-09-03 19:54:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 19:54:37,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:37,953 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:37,953 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:37,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1669798739, now seen corresponding path program 46 times [2019-09-03 19:54:37,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11958 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:54:38,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:38,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:39,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:39,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-03 19:54:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11958 backedges. 0 proven. 11958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 150] total 153 [2019-09-03 19:54:42,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 19:54:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 19:54:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11036, Invalid=12220, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:54:42,709 INFO L87 Difference]: Start difference. First operand 601 states and 700 transitions. Second operand 153 states. [2019-09-03 19:54:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:49,020 INFO L93 Difference]: Finished difference Result 854 states and 1003 transitions. [2019-09-03 19:54:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-03 19:54:49,021 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 306 [2019-09-03 19:54:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:49,022 INFO L225 Difference]: With dead ends: 854 [2019-09-03 19:54:49,022 INFO L226 Difference]: Without dead ends: 846 [2019-09-03 19:54:49,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9988 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=11042, Invalid=12520, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:54:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-03 19:54:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 608. [2019-09-03 19:54:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-03 19:54:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 708 transitions. [2019-09-03 19:54:49,027 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 708 transitions. Word has length 306 [2019-09-03 19:54:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:49,027 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 708 transitions. [2019-09-03 19:54:49,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 19:54:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 708 transitions. [2019-09-03 19:54:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 19:54:49,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:49,029 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 49, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:49,029 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash 300726061, now seen corresponding path program 47 times [2019-09-03 19:54:49,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:54:50,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:50,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:50,111 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:50,358 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:54:50,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:50,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-03 19:54:50,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:53,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 12252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:53,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:53,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 152] total 154 [2019-09-03 19:54:53,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 19:54:53,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 19:54:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11185, Invalid=12377, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:54:53,966 INFO L87 Difference]: Start difference. First operand 608 states and 708 transitions. Second operand 154 states. [2019-09-03 19:55:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:00,976 INFO L93 Difference]: Finished difference Result 763 states and 912 transitions. [2019-09-03 19:55:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 19:55:00,977 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 310 [2019-09-03 19:55:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:00,978 INFO L225 Difference]: With dead ends: 763 [2019-09-03 19:55:00,978 INFO L226 Difference]: Without dead ends: 757 [2019-09-03 19:55:00,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10190 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=11191, Invalid=12679, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 19:55:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-03 19:55:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 610. [2019-09-03 19:55:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-03 19:55:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 710 transitions. [2019-09-03 19:55:00,983 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 710 transitions. Word has length 310 [2019-09-03 19:55:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:00,984 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 710 transitions. [2019-09-03 19:55:00,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 19:55:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 710 transitions. [2019-09-03 19:55:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 19:55:00,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:00,986 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:00,987 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash 909805384, now seen corresponding path program 48 times [2019-09-03 19:55:00,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:00,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:02,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:02,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:02,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 99 check-sat command(s) [2019-09-03 19:55:02,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:02,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:55:02,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:02,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:02,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:02,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-03 19:55:02,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:55:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:55:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:02,412 INFO L87 Difference]: Start difference. First operand 610 states and 710 transitions. Second operand 56 states. [2019-09-03 19:55:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:02,967 INFO L93 Difference]: Finished difference Result 10516 states and 10616 transitions. [2019-09-03 19:55:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:55:02,968 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 312 [2019-09-03 19:55:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:02,975 INFO L225 Difference]: With dead ends: 10516 [2019-09-03 19:55:02,975 INFO L226 Difference]: Without dead ends: 10510 [2019-09-03 19:55:02,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10510 states. [2019-09-03 19:55:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10510 to 607. [2019-09-03 19:55:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-03 19:55:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 706 transitions. [2019-09-03 19:55:03,013 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 706 transitions. Word has length 312 [2019-09-03 19:55:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:03,014 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 706 transitions. [2019-09-03 19:55:03,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:55:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 706 transitions. [2019-09-03 19:55:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 19:55:03,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:03,016 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:03,016 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2050288450, now seen corresponding path program 49 times [2019-09-03 19:55:03,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:55:04,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:04,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:04,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 19:55:04,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:07,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 12252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:07,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:07,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 153] total 156 [2019-09-03 19:55:07,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 19:55:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 19:55:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=12694, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 19:55:07,957 INFO L87 Difference]: Start difference. First operand 607 states and 706 transitions. Second operand 156 states. [2019-09-03 19:55:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:14,680 INFO L93 Difference]: Finished difference Result 875 states and 1027 transitions. [2019-09-03 19:55:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-03 19:55:14,680 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 312 [2019-09-03 19:55:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:14,682 INFO L225 Difference]: With dead ends: 875 [2019-09-03 19:55:14,682 INFO L226 Difference]: Without dead ends: 867 [2019-09-03 19:55:14,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10594 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11492, Invalid=13000, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 19:55:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-09-03 19:55:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 614. [2019-09-03 19:55:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-03 19:55:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 714 transitions. [2019-09-03 19:55:14,688 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 714 transitions. Word has length 312 [2019-09-03 19:55:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:14,688 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 714 transitions. [2019-09-03 19:55:14,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 19:55:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 714 transitions. [2019-09-03 19:55:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 19:55:14,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:14,690 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:14,690 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 683083582, now seen corresponding path program 50 times [2019-09-03 19:55:14,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:14,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:14,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:14,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:15,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:15,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:15,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:16,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:16,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-03 19:55:16,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:19,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12552 backedges. 0 proven. 12552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 155] total 157 [2019-09-03 19:55:19,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 19:55:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 19:55:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11638, Invalid=12854, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 19:55:19,952 INFO L87 Difference]: Start difference. First operand 614 states and 714 transitions. Second operand 157 states. [2019-09-03 19:55:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:25,773 INFO L93 Difference]: Finished difference Result 778 states and 930 transitions. [2019-09-03 19:55:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 19:55:25,774 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 316 [2019-09-03 19:55:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:25,775 INFO L225 Difference]: With dead ends: 778 [2019-09-03 19:55:25,775 INFO L226 Difference]: Without dead ends: 772 [2019-09-03 19:55:25,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10796 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=11644, Invalid=13162, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 19:55:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-03 19:55:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 616. [2019-09-03 19:55:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-03 19:55:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 716 transitions. [2019-09-03 19:55:25,780 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 716 transitions. Word has length 316 [2019-09-03 19:55:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:25,781 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 716 transitions. [2019-09-03 19:55:25,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 19:55:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 716 transitions. [2019-09-03 19:55:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 19:55:25,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:25,782 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 53, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:25,782 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1011804391, now seen corresponding path program 51 times [2019-09-03 19:55:25,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:25,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:25,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:26,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:26,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:26,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:27,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 19:55:27,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:27,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:55:27,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-03 19:55:27,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:55:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:55:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:55:27,225 INFO L87 Difference]: Start difference. First operand 616 states and 716 transitions. Second operand 59 states. [2019-09-03 19:55:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:27,778 INFO L93 Difference]: Finished difference Result 11116 states and 11216 transitions. [2019-09-03 19:55:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:55:27,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 318 [2019-09-03 19:55:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:27,785 INFO L225 Difference]: With dead ends: 11116 [2019-09-03 19:55:27,785 INFO L226 Difference]: Without dead ends: 11110 [2019-09-03 19:55:27,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:55:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-09-03 19:55:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 613. [2019-09-03 19:55:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-03 19:55:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 712 transitions. [2019-09-03 19:55:27,825 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 712 transitions. Word has length 318 [2019-09-03 19:55:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:27,826 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 712 transitions. [2019-09-03 19:55:27,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:55:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 712 transitions. [2019-09-03 19:55:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 19:55:27,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:27,828 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 54, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:27,828 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1476604943, now seen corresponding path program 52 times [2019-09-03 19:55:27,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:27,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:55:29,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:29,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:29,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:29,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:29,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:29,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-03 19:55:29,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:32,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 0 proven. 12564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:32,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 156] total 159 [2019-09-03 19:55:32,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 19:55:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 19:55:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11945, Invalid=13177, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 19:55:32,778 INFO L87 Difference]: Start difference. First operand 613 states and 712 transitions. Second operand 159 states. [2019-09-03 19:55:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:39,670 INFO L93 Difference]: Finished difference Result 896 states and 1051 transitions. [2019-09-03 19:55:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-03 19:55:39,670 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 318 [2019-09-03 19:55:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:39,672 INFO L225 Difference]: With dead ends: 896 [2019-09-03 19:55:39,672 INFO L226 Difference]: Without dead ends: 888 [2019-09-03 19:55:39,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11200 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11951, Invalid=13489, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:55:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-03 19:55:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 620. [2019-09-03 19:55:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-03 19:55:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 720 transitions. [2019-09-03 19:55:39,678 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 720 transitions. Word has length 318 [2019-09-03 19:55:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:39,678 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 720 transitions. [2019-09-03 19:55:39,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 19:55:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 720 transitions. [2019-09-03 19:55:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-03 19:55:39,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:39,680 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 55, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:39,680 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash -170965361, now seen corresponding path program 53 times [2019-09-03 19:55:39,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:39,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:39,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12870 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:40,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:40,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:41,188 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:55:41,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:41,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-03 19:55:41,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12870 backedges. 0 proven. 12870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:44,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:44,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 158] total 160 [2019-09-03 19:55:44,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 19:55:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 19:55:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12100, Invalid=13340, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:55:44,851 INFO L87 Difference]: Start difference. First operand 620 states and 720 transitions. Second operand 160 states. [2019-09-03 19:55:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:51,627 INFO L93 Difference]: Finished difference Result 793 states and 948 transitions. [2019-09-03 19:55:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-03 19:55:51,627 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 322 [2019-09-03 19:55:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:51,629 INFO L225 Difference]: With dead ends: 793 [2019-09-03 19:55:51,629 INFO L226 Difference]: Without dead ends: 787 [2019-09-03 19:55:51,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11402 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=12106, Invalid=13654, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 19:55:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-03 19:55:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 622. [2019-09-03 19:55:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-03 19:55:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 722 transitions. [2019-09-03 19:55:51,634 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 722 transitions. Word has length 322 [2019-09-03 19:55:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:51,634 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 722 transitions. [2019-09-03 19:55:51,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 19:55:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 722 transitions. [2019-09-03 19:55:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 19:55:51,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:51,637 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 56, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:51,637 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1414085078, now seen corresponding path program 54 times [2019-09-03 19:55:51,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:51,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:51,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12980 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:55:52,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:53,224 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 19:55:53,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:53,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12980 backedges. 0 proven. 12980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 159] total 161 [2019-09-03 19:55:56,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-03 19:55:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-03 19:55:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12256, Invalid=13504, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 19:55:56,880 INFO L87 Difference]: Start difference. First operand 622 states and 722 transitions. Second operand 161 states. [2019-09-03 19:56:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:04,055 INFO L93 Difference]: Finished difference Result 798 states and 954 transitions. [2019-09-03 19:56:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-03 19:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 324 [2019-09-03 19:56:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:04,057 INFO L225 Difference]: With dead ends: 798 [2019-09-03 19:56:04,057 INFO L226 Difference]: Without dead ends: 792 [2019-09-03 19:56:04,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11604 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=12262, Invalid=13820, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 19:56:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-03 19:56:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 624. [2019-09-03 19:56:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-03 19:56:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 724 transitions. [2019-09-03 19:56:04,063 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 724 transitions. Word has length 324 [2019-09-03 19:56:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,063 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 724 transitions. [2019-09-03 19:56:04,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-03 19:56:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 724 transitions. [2019-09-03 19:56:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-03 19:56:04,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,066 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 57, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:04,066 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2051224827, now seen corresponding path program 55 times [2019-09-03 19:56:04,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13092 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:56:05,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:05,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:05,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:05,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-03 19:56:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:09,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13092 backedges. 0 proven. 13092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:09,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:09,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 160] total 162 [2019-09-03 19:56:09,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 19:56:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 19:56:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12413, Invalid=13669, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 19:56:09,170 INFO L87 Difference]: Start difference. First operand 624 states and 724 transitions. Second operand 162 states. [2019-09-03 19:56:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:16,034 INFO L93 Difference]: Finished difference Result 803 states and 960 transitions. [2019-09-03 19:56:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 19:56:16,034 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 326 [2019-09-03 19:56:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:16,036 INFO L225 Difference]: With dead ends: 803 [2019-09-03 19:56:16,036 INFO L226 Difference]: Without dead ends: 797 [2019-09-03 19:56:16,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11806 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=12419, Invalid=13987, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 19:56:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-03 19:56:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 626. [2019-09-03 19:56:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-03 19:56:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2019-09-03 19:56:16,042 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 326 [2019-09-03 19:56:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:16,042 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2019-09-03 19:56:16,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 19:56:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2019-09-03 19:56:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-03 19:56:16,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:16,044 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 58, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:16,044 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:16,045 INFO L82 PathProgramCache]: Analyzing trace with hash -162200288, now seen corresponding path program 56 times [2019-09-03 19:56:16,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:16,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13206 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:56:17,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:17,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:17,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:17,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:17,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:17,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 19:56:17,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13206 backedges. 0 proven. 13206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 161] total 163 [2019-09-03 19:56:21,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 19:56:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 19:56:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12571, Invalid=13835, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 19:56:21,256 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 163 states. [2019-09-03 19:56:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:27,889 INFO L93 Difference]: Finished difference Result 808 states and 966 transitions. [2019-09-03 19:56:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-03 19:56:27,890 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 328 [2019-09-03 19:56:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:27,891 INFO L225 Difference]: With dead ends: 808 [2019-09-03 19:56:27,891 INFO L226 Difference]: Without dead ends: 802 [2019-09-03 19:56:27,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12008 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12577, Invalid=14155, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 19:56:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-03 19:56:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 628. [2019-09-03 19:56:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-03 19:56:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 728 transitions. [2019-09-03 19:56:27,897 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 728 transitions. Word has length 328 [2019-09-03 19:56:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:27,898 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 728 transitions. [2019-09-03 19:56:27,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 19:56:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 728 transitions. [2019-09-03 19:56:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-03 19:56:27,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:27,900 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 59, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:27,900 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1580784517, now seen corresponding path program 57 times [2019-09-03 19:56:27,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13322 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:56:29,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:29,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:29,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:29,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-03 19:56:29,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:29,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:56:29,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:29,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13322 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:56:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:29,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-03 19:56:29,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:56:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:56:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:56:29,739 INFO L87 Difference]: Start difference. First operand 628 states and 728 transitions. Second operand 65 states. [2019-09-03 19:56:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:30,459 INFO L93 Difference]: Finished difference Result 12316 states and 12416 transitions. [2019-09-03 19:56:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:56:30,460 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 330 [2019-09-03 19:56:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:30,468 INFO L225 Difference]: With dead ends: 12316 [2019-09-03 19:56:30,468 INFO L226 Difference]: Without dead ends: 12310 [2019-09-03 19:56:30,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:56:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12310 states. [2019-09-03 19:56:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12310 to 625. [2019-09-03 19:56:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-03 19:56:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 724 transitions. [2019-09-03 19:56:30,500 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 724 transitions. Word has length 330 [2019-09-03 19:56:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:30,500 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 724 transitions. [2019-09-03 19:56:30,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:56:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 724 transitions. [2019-09-03 19:56:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-03 19:56:30,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:30,502 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 60, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:30,502 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -776503183, now seen corresponding path program 58 times [2019-09-03 19:56:30,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:30,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13242 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:56:32,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:32,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:32,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:32,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:32,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-03 19:56:32,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13242 backedges. 0 proven. 13242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:35,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:35,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 162] total 165 [2019-09-03 19:56:35,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 19:56:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 19:56:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12890, Invalid=14170, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:56:35,997 INFO L87 Difference]: Start difference. First operand 625 states and 724 transitions. Second operand 165 states. [2019-09-03 19:56:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:44,055 INFO L93 Difference]: Finished difference Result 938 states and 1099 transitions. [2019-09-03 19:56:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 19:56:44,055 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 330 [2019-09-03 19:56:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:44,057 INFO L225 Difference]: With dead ends: 938 [2019-09-03 19:56:44,057 INFO L226 Difference]: Without dead ends: 930 [2019-09-03 19:56:44,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12412 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=12896, Invalid=14494, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 19:56:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-09-03 19:56:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 632. [2019-09-03 19:56:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-03 19:56:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 732 transitions. [2019-09-03 19:56:44,064 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 732 transitions. Word has length 330 [2019-09-03 19:56:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:44,064 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 732 transitions. [2019-09-03 19:56:44,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 19:56:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 732 transitions. [2019-09-03 19:56:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-03 19:56:44,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:44,066 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 61, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:44,066 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1787047183, now seen corresponding path program 59 times [2019-09-03 19:56:44,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:44,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:44,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13560 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:56:45,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:45,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:45,819 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:56:45,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:45,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-03 19:56:45,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:49,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13560 backedges. 0 proven. 13560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:49,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:49,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 164] total 166 [2019-09-03 19:56:49,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 19:56:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 19:56:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 19:56:49,474 INFO L87 Difference]: Start difference. First operand 632 states and 732 transitions. Second operand 166 states. [2019-09-03 19:56:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:58,686 INFO L93 Difference]: Finished difference Result 823 states and 984 transitions. [2019-09-03 19:56:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 19:56:58,687 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 334 [2019-09-03 19:56:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:58,688 INFO L225 Difference]: With dead ends: 823 [2019-09-03 19:56:58,688 INFO L226 Difference]: Without dead ends: 817 [2019-09-03 19:56:58,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12614 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 19:56:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-09-03 19:56:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 634. [2019-09-03 19:56:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-03 19:56:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 734 transitions. [2019-09-03 19:56:58,694 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 734 transitions. Word has length 334 [2019-09-03 19:56:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:58,694 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 734 transitions. [2019-09-03 19:56:58,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 19:56:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 734 transitions. [2019-09-03 19:56:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-03 19:56:58,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:58,696 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 62, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:58,696 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 309445132, now seen corresponding path program 60 times [2019-09-03 19:56:58,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:58,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:58,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13682 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:57:00,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:00,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:00,614 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 19:57:00,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:00,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-03 19:57:00,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13682 backedges. 0 proven. 13682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:04,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 165] total 167 [2019-09-03 19:57:04,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-03 19:57:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-03 19:57:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13213, Invalid=14509, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 19:57:04,269 INFO L87 Difference]: Start difference. First operand 634 states and 734 transitions. Second operand 167 states. [2019-09-03 19:57:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:12,127 INFO L93 Difference]: Finished difference Result 828 states and 990 transitions. [2019-09-03 19:57:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-03 19:57:12,127 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 336 [2019-09-03 19:57:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:12,129 INFO L225 Difference]: With dead ends: 828 [2019-09-03 19:57:12,129 INFO L226 Difference]: Without dead ends: 822 [2019-09-03 19:57:12,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12816 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13219, Invalid=14837, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 19:57:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-09-03 19:57:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 636. [2019-09-03 19:57:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-03 19:57:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 736 transitions. [2019-09-03 19:57:12,135 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 736 transitions. Word has length 336 [2019-09-03 19:57:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:12,136 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 736 transitions. [2019-09-03 19:57:12,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-03 19:57:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 736 transitions. [2019-09-03 19:57:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-03 19:57:12,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:12,138 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 63, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:12,138 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash 698898023, now seen corresponding path program 61 times [2019-09-03 19:57:12,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:12,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:12,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:12,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:57:13,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:13,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:13,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-03 19:57:13,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:17,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:17,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 166] total 168 [2019-09-03 19:57:17,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 19:57:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 19:57:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 19:57:17,462 INFO L87 Difference]: Start difference. First operand 636 states and 736 transitions. Second operand 168 states. [2019-09-03 19:57:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:25,501 INFO L93 Difference]: Finished difference Result 833 states and 996 transitions. [2019-09-03 19:57:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-03 19:57:25,501 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 338 [2019-09-03 19:57:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:25,503 INFO L225 Difference]: With dead ends: 833 [2019-09-03 19:57:25,503 INFO L226 Difference]: Without dead ends: 827 [2019-09-03 19:57:25,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13018 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 19:57:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-03 19:57:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 638. [2019-09-03 19:57:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-03 19:57:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 738 transitions. [2019-09-03 19:57:25,509 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 738 transitions. Word has length 338 [2019-09-03 19:57:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:25,509 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 738 transitions. [2019-09-03 19:57:25,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 19:57:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 738 transitions. [2019-09-03 19:57:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 19:57:25,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:25,511 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 64, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:25,511 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1300971522, now seen corresponding path program 62 times [2019-09-03 19:57:25,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:25,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13932 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:57:27,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:27,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:27,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:27,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:27,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:27,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-03 19:57:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:30,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13932 backedges. 0 proven. 13932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:31,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 167] total 169 [2019-09-03 19:57:31,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 19:57:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 19:57:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13540, Invalid=14852, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 19:57:31,134 INFO L87 Difference]: Start difference. First operand 638 states and 738 transitions. Second operand 169 states. [2019-09-03 19:57:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:41,606 INFO L93 Difference]: Finished difference Result 838 states and 1002 transitions. [2019-09-03 19:57:41,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-03 19:57:41,606 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 340 [2019-09-03 19:57:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:41,608 INFO L225 Difference]: With dead ends: 838 [2019-09-03 19:57:41,608 INFO L226 Difference]: Without dead ends: 832 [2019-09-03 19:57:41,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13220 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=13546, Invalid=15184, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 19:57:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-03 19:57:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 640. [2019-09-03 19:57:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-03 19:57:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 740 transitions. [2019-09-03 19:57:41,615 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 740 transitions. Word has length 340 [2019-09-03 19:57:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:41,615 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 740 transitions. [2019-09-03 19:57:41,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 19:57:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 740 transitions. [2019-09-03 19:57:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-03 19:57:41,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:41,617 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 65, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:41,617 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash 73019101, now seen corresponding path program 63 times [2019-09-03 19:57:41,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:41,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:41,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:57:43,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:43,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:43,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2019-09-03 19:57:43,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:43,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:57:43,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:43,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:57:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:43,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 71 [2019-09-03 19:57:43,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:57:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:57:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2221, Invalid=2749, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:57:43,584 INFO L87 Difference]: Start difference. First operand 640 states and 740 transitions. Second operand 71 states. [2019-09-03 19:57:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:44,564 INFO L93 Difference]: Finished difference Result 13516 states and 13616 transitions. [2019-09-03 19:57:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:57:44,565 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2019-09-03 19:57:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:44,573 INFO L225 Difference]: With dead ends: 13516 [2019-09-03 19:57:44,573 INFO L226 Difference]: Without dead ends: 13510 [2019-09-03 19:57:44,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2227, Invalid=2885, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:57:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2019-09-03 19:57:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 637. [2019-09-03 19:57:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-03 19:57:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 736 transitions. [2019-09-03 19:57:44,628 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 736 transitions. Word has length 342 [2019-09-03 19:57:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 736 transitions. [2019-09-03 19:57:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:57:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 736 transitions. [2019-09-03 19:57:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-03 19:57:44,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:44,632 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 66, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:44,632 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1853732397, now seen corresponding path program 64 times [2019-09-03 19:57:44,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:44,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:57:46,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:46,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:46,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:46,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:46,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-03 19:57:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:50,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 13992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:50,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 168] total 171 [2019-09-03 19:57:50,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 19:57:50,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 19:57:50,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=15199, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 19:57:50,160 INFO L87 Difference]: Start difference. First operand 637 states and 736 transitions. Second operand 171 states. [2019-09-03 19:58:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:00,711 INFO L93 Difference]: Finished difference Result 980 states and 1147 transitions. [2019-09-03 19:58:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-03 19:58:00,712 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 342 [2019-09-03 19:58:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:00,713 INFO L225 Difference]: With dead ends: 980 [2019-09-03 19:58:00,713 INFO L226 Difference]: Without dead ends: 972 [2019-09-03 19:58:00,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13624 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13877, Invalid=15535, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:58:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-03 19:58:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 644. [2019-09-03 19:58:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-03 19:58:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 744 transitions. [2019-09-03 19:58:00,722 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 744 transitions. Word has length 342 [2019-09-03 19:58:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:00,722 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 744 transitions. [2019-09-03 19:58:00,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 19:58:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 744 transitions. [2019-09-03 19:58:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-03 19:58:00,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:00,725 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 67, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:00,725 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 148823123, now seen corresponding path program 65 times [2019-09-03 19:58:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:00,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14322 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:58:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:02,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:02,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:58:02,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:02,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-03 19:58:02,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:06,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14322 backedges. 0 proven. 14322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:06,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 170] total 172 [2019-09-03 19:58:06,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 19:58:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 19:58:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14038, Invalid=15374, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:58:06,321 INFO L87 Difference]: Start difference. First operand 644 states and 744 transitions. Second operand 172 states. [2019-09-03 19:58:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:15,971 INFO L93 Difference]: Finished difference Result 853 states and 1020 transitions. [2019-09-03 19:58:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-03 19:58:15,972 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 346 [2019-09-03 19:58:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:15,973 INFO L225 Difference]: With dead ends: 853 [2019-09-03 19:58:15,973 INFO L226 Difference]: Without dead ends: 847 [2019-09-03 19:58:15,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13826 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=14044, Invalid=15712, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 19:58:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-03 19:58:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 646. [2019-09-03 19:58:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-03 19:58:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 746 transitions. [2019-09-03 19:58:15,981 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 746 transitions. Word has length 346 [2019-09-03 19:58:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:15,982 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 746 transitions. [2019-09-03 19:58:15,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 19:58:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 746 transitions. [2019-09-03 19:58:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 19:58:15,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:15,984 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 68, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:15,984 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash 959970030, now seen corresponding path program 66 times [2019-09-03 19:58:15,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:15,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:15,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14456 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:58:17,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:17,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:18,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 19:58:18,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:18,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 19:58:18,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:21,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14456 backedges. 0 proven. 14456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:21,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 171] total 173 [2019-09-03 19:58:21,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-03 19:58:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-03 19:58:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14206, Invalid=15550, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 19:58:21,804 INFO L87 Difference]: Start difference. First operand 646 states and 746 transitions. Second operand 173 states. [2019-09-03 19:58:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:31,850 INFO L93 Difference]: Finished difference Result 858 states and 1026 transitions. [2019-09-03 19:58:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-03 19:58:31,851 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 348 [2019-09-03 19:58:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:31,852 INFO L225 Difference]: With dead ends: 858 [2019-09-03 19:58:31,852 INFO L226 Difference]: Without dead ends: 852 [2019-09-03 19:58:31,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14028 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14212, Invalid=15890, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 19:58:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-03 19:58:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 648. [2019-09-03 19:58:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-03 19:58:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 748 transitions. [2019-09-03 19:58:31,859 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 748 transitions. Word has length 348 [2019-09-03 19:58:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:31,859 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 748 transitions. [2019-09-03 19:58:31,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-03 19:58:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 748 transitions. [2019-09-03 19:58:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-03 19:58:31,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:31,861 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 69, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:31,861 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1211900215, now seen corresponding path program 67 times [2019-09-03 19:58:31,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:31,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:31,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:58:33,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:33,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:33,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:33,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-03 19:58:33,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 14592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:37,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 172] total 174 [2019-09-03 19:58:37,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 19:58:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 19:58:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14375, Invalid=15727, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 19:58:37,628 INFO L87 Difference]: Start difference. First operand 648 states and 748 transitions. Second operand 174 states. [2019-09-03 19:58:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:47,008 INFO L93 Difference]: Finished difference Result 863 states and 1032 transitions. [2019-09-03 19:58:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 19:58:47,009 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 350 [2019-09-03 19:58:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:47,010 INFO L225 Difference]: With dead ends: 863 [2019-09-03 19:58:47,011 INFO L226 Difference]: Without dead ends: 857 [2019-09-03 19:58:47,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14230 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=14381, Invalid=16069, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 19:58:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-03 19:58:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 650. [2019-09-03 19:58:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-03 19:58:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 750 transitions. [2019-09-03 19:58:47,016 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 750 transitions. Word has length 350 [2019-09-03 19:58:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:47,016 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 750 transitions. [2019-09-03 19:58:47,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 19:58:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 750 transitions. [2019-09-03 19:58:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-03 19:58:47,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:47,018 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 70, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:47,018 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1025099804, now seen corresponding path program 68 times [2019-09-03 19:58:47,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:47,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:47,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:47,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14730 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:58:48,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:48,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:49,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:49,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:49,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-03 19:58:49,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14730 backedges. 0 proven. 14730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 173] total 175 [2019-09-03 19:58:52,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-03 19:58:52,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-03 19:58:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14545, Invalid=15905, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 19:58:52,696 INFO L87 Difference]: Start difference. First operand 650 states and 750 transitions. Second operand 175 states. [2019-09-03 19:59:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:02,417 INFO L93 Difference]: Finished difference Result 868 states and 1038 transitions. [2019-09-03 19:59:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-03 19:59:02,418 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 352 [2019-09-03 19:59:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:02,419 INFO L225 Difference]: With dead ends: 868 [2019-09-03 19:59:02,419 INFO L226 Difference]: Without dead ends: 862 [2019-09-03 19:59:02,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14432 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14551, Invalid=16249, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 19:59:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-03 19:59:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 652. [2019-09-03 19:59:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-03 19:59:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 752 transitions. [2019-09-03 19:59:02,425 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 752 transitions. Word has length 352 [2019-09-03 19:59:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:02,425 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 752 transitions. [2019-09-03 19:59:02,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-03 19:59:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 752 transitions. [2019-09-03 19:59:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-03 19:59:02,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:02,427 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 71, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:02,427 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1898531265, now seen corresponding path program 69 times [2019-09-03 19:59:02,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:02,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14870 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:59:04,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:04,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:04,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2019-09-03 19:59:04,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:04,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:59:04,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:04,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14870 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:59:04,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:04,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 77 [2019-09-03 19:59:04,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:59:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:59:04,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2638, Invalid=3214, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:59:04,858 INFO L87 Difference]: Start difference. First operand 652 states and 752 transitions. Second operand 77 states. [2019-09-03 19:59:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:06,092 INFO L93 Difference]: Finished difference Result 14716 states and 14816 transitions. [2019-09-03 19:59:06,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:59:06,092 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 354 [2019-09-03 19:59:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:06,101 INFO L225 Difference]: With dead ends: 14716 [2019-09-03 19:59:06,102 INFO L226 Difference]: Without dead ends: 14710 [2019-09-03 19:59:06,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2644, Invalid=3362, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:59:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2019-09-03 19:59:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 649. [2019-09-03 19:59:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-03 19:59:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 748 transitions. [2019-09-03 19:59:06,137 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 748 transitions. Word has length 354 [2019-09-03 19:59:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:06,138 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 748 transitions. [2019-09-03 19:59:06,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:59:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 748 transitions. [2019-09-03 19:59:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-03 19:59:06,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:06,140 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 72, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:06,140 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 546312245, now seen corresponding path program 70 times [2019-09-03 19:59:06,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:06,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:06,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:06,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14814 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 19:59:08,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:08,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:08,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:08,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:08,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:08,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-03 19:59:08,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:11,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14814 backedges. 0 proven. 14814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:11,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:11,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 174] total 177 [2019-09-03 19:59:11,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 19:59:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 19:59:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14888, Invalid=16264, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 19:59:11,863 INFO L87 Difference]: Start difference. First operand 649 states and 748 transitions. Second operand 177 states. [2019-09-03 19:59:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,285 INFO L93 Difference]: Finished difference Result 1022 states and 1195 transitions. [2019-09-03 19:59:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-03 19:59:21,285 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 354 [2019-09-03 19:59:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,287 INFO L225 Difference]: With dead ends: 1022 [2019-09-03 19:59:21,287 INFO L226 Difference]: Without dead ends: 1014 [2019-09-03 19:59:21,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14836 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14894, Invalid=16612, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:59:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-09-03 19:59:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 656. [2019-09-03 19:59:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-03 19:59:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 756 transitions. [2019-09-03 19:59:21,294 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 756 transitions. Word has length 354 [2019-09-03 19:59:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,294 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 756 transitions. [2019-09-03 19:59:21,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 19:59:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 756 transitions. [2019-09-03 19:59:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-03 19:59:21,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,296 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 73, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,296 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1764025013, now seen corresponding path program 71 times [2019-09-03 19:59:21,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15156 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:59:23,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:23,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:23,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 19:59:23,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:23,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 178 conjunts are in the unsatisfiable core [2019-09-03 19:59:23,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15156 backedges. 0 proven. 15156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:27,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:27,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 176] total 178 [2019-09-03 19:59:27,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-03 19:59:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-03 19:59:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15061, Invalid=16445, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:59:27,338 INFO L87 Difference]: Start difference. First operand 656 states and 756 transitions. Second operand 178 states. [2019-09-03 19:59:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:39,842 INFO L93 Difference]: Finished difference Result 883 states and 1056 transitions. [2019-09-03 19:59:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 19:59:39,843 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 358 [2019-09-03 19:59:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:39,844 INFO L225 Difference]: With dead ends: 883 [2019-09-03 19:59:39,844 INFO L226 Difference]: Without dead ends: 877 [2019-09-03 19:59:39,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15038 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=15067, Invalid=16795, Unknown=0, NotChecked=0, Total=31862 [2019-09-03 19:59:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-09-03 19:59:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 658. [2019-09-03 19:59:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-03 19:59:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 758 transitions. [2019-09-03 19:59:39,850 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 758 transitions. Word has length 358 [2019-09-03 19:59:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:39,851 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 758 transitions. [2019-09-03 19:59:39,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-03 19:59:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 758 transitions. [2019-09-03 19:59:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-03 19:59:39,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:39,853 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 74, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:39,853 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1609174832, now seen corresponding path program 72 times [2019-09-03 19:59:39,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:39,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15302 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 19:59:42,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:42,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:42,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:42,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 19:59:42,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:42,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 179 conjunts are in the unsatisfiable core [2019-09-03 19:59:42,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:45,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 15302 backedges. 0 proven. 15302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:45,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 177] total 179 [2019-09-03 19:59:45,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 179 states [2019-09-03 19:59:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2019-09-03 19:59:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15235, Invalid=16627, Unknown=0, NotChecked=0, Total=31862 [2019-09-03 19:59:45,965 INFO L87 Difference]: Start difference. First operand 658 states and 758 transitions. Second operand 179 states. [2019-09-03 19:59:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:57,797 INFO L93 Difference]: Finished difference Result 888 states and 1062 transitions. [2019-09-03 19:59:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-09-03 19:59:57,797 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 360 [2019-09-03 19:59:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:57,799 INFO L225 Difference]: With dead ends: 888 [2019-09-03 19:59:57,799 INFO L226 Difference]: Without dead ends: 882 [2019-09-03 19:59:57,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=15241, Invalid=16979, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 19:59:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-09-03 19:59:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 660. [2019-09-03 19:59:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-03 19:59:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 760 transitions. [2019-09-03 19:59:57,804 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 760 transitions. Word has length 360 [2019-09-03 19:59:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:57,804 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 760 transitions. [2019-09-03 19:59:57,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 179 states. [2019-09-03 19:59:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 760 transitions. [2019-09-03 19:59:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-03 19:59:57,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:57,806 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 75, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:57,806 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -553917397, now seen corresponding path program 73 times [2019-09-03 19:59:57,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:57,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:57,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:57,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15450 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:00:00,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:00,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:00,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 180 conjunts are in the unsatisfiable core [2019-09-03 20:00:00,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:03,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15450 backedges. 0 proven. 15450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:03,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:03,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 178] total 180 [2019-09-03 20:00:03,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-09-03 20:00:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-09-03 20:00:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15410, Invalid=16810, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 20:00:03,917 INFO L87 Difference]: Start difference. First operand 660 states and 760 transitions. Second operand 180 states. [2019-09-03 20:00:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:16,988 INFO L93 Difference]: Finished difference Result 893 states and 1068 transitions. [2019-09-03 20:00:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-03 20:00:16,988 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 362 [2019-09-03 20:00:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:16,990 INFO L225 Difference]: With dead ends: 893 [2019-09-03 20:00:16,990 INFO L226 Difference]: Without dead ends: 887 [2019-09-03 20:00:16,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15442 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=15416, Invalid=17164, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 20:00:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-03 20:00:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 662. [2019-09-03 20:00:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-03 20:00:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 762 transitions. [2019-09-03 20:00:16,997 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 762 transitions. Word has length 362 [2019-09-03 20:00:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:16,997 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 762 transitions. [2019-09-03 20:00:16,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-09-03 20:00:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 762 transitions. [2019-09-03 20:00:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 20:00:16,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:17,000 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 76, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:17,000 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -63804218, now seen corresponding path program 74 times [2019-09-03 20:00:17,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:17,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15600 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:00:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:19,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:19,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:19,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:19,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 181 conjunts are in the unsatisfiable core [2019-09-03 20:00:19,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:22,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15600 backedges. 0 proven. 15600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:23,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 179] total 181 [2019-09-03 20:00:23,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 181 states [2019-09-03 20:00:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2019-09-03 20:00:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15586, Invalid=16994, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 20:00:23,073 INFO L87 Difference]: Start difference. First operand 662 states and 762 transitions. Second operand 181 states. [2019-09-03 20:00:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:36,345 INFO L93 Difference]: Finished difference Result 898 states and 1074 transitions. [2019-09-03 20:00:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-09-03 20:00:36,345 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 364 [2019-09-03 20:00:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:36,346 INFO L225 Difference]: With dead ends: 898 [2019-09-03 20:00:36,347 INFO L226 Difference]: Without dead ends: 892 [2019-09-03 20:00:36,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15644 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=15592, Invalid=17350, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:00:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-09-03 20:00:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 664. [2019-09-03 20:00:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-03 20:00:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 764 transitions. [2019-09-03 20:00:36,352 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 764 transitions. Word has length 364 [2019-09-03 20:00:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:36,352 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 764 transitions. [2019-09-03 20:00:36,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 181 states. [2019-09-03 20:00:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 764 transitions. [2019-09-03 20:00:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-03 20:00:36,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:36,354 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 77, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:36,354 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1511441759, now seen corresponding path program 75 times [2019-09-03 20:00:36,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 15752 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:00:38,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:38,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:38,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:38,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2019-09-03 20:00:38,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:38,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:00:38,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15752 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:00:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 83 [2019-09-03 20:00:38,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:00:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:00:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3091, Invalid=3715, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:00:38,992 INFO L87 Difference]: Start difference. First operand 664 states and 764 transitions. Second operand 83 states. [2019-09-03 20:00:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:40,368 INFO L93 Difference]: Finished difference Result 15916 states and 16016 transitions. [2019-09-03 20:00:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:00:40,369 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 366 [2019-09-03 20:00:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:40,378 INFO L225 Difference]: With dead ends: 15916 [2019-09-03 20:00:40,378 INFO L226 Difference]: Without dead ends: 15910 [2019-09-03 20:00:40,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3097, Invalid=3875, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:00:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15910 states. [2019-09-03 20:00:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15910 to 661. [2019-09-03 20:00:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-03 20:00:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 760 transitions. [2019-09-03 20:00:40,424 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 760 transitions. Word has length 366 [2019-09-03 20:00:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:40,425 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 760 transitions. [2019-09-03 20:00:40,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:00:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 760 transitions. [2019-09-03 20:00:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-03 20:00:40,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:40,427 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 78, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:40,428 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:40,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash 692933527, now seen corresponding path program 76 times [2019-09-03 20:00:40,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:40,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:40,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:40,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:40,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15708 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 20:00:42,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:42,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:42,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:42,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:42,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:42,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 182 conjunts are in the unsatisfiable core [2019-09-03 20:00:42,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15708 backedges. 0 proven. 15708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:46,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:46,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 180] total 183 [2019-09-03 20:00:46,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 183 states [2019-09-03 20:00:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2019-09-03 20:00:46,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15941, Invalid=17365, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 20:00:46,578 INFO L87 Difference]: Start difference. First operand 661 states and 760 transitions. Second operand 183 states. [2019-09-03 20:00:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:58,196 INFO L93 Difference]: Finished difference Result 1064 states and 1243 transitions. [2019-09-03 20:00:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-09-03 20:00:58,197 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 366 [2019-09-03 20:00:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:58,199 INFO L225 Difference]: With dead ends: 1064 [2019-09-03 20:00:58,199 INFO L226 Difference]: Without dead ends: 1056 [2019-09-03 20:00:58,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16048 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=15947, Invalid=17725, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 20:00:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-03 20:00:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 668. [2019-09-03 20:00:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-03 20:00:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 768 transitions. [2019-09-03 20:00:58,204 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 768 transitions. Word has length 366 [2019-09-03 20:00:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:58,205 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 768 transitions. [2019-09-03 20:00:58,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 183 states. [2019-09-03 20:00:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 768 transitions. [2019-09-03 20:00:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-03 20:00:58,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:58,207 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 79, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:58,207 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash -256219625, now seen corresponding path program 77 times [2019-09-03 20:00:58,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16062 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:01:00,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:00,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:00,611 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:01:00,921 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 20:01:00,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:00,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 184 conjunts are in the unsatisfiable core [2019-09-03 20:01:00,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:04,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16062 backedges. 0 proven. 16062 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:04,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:04,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 182] total 184 [2019-09-03 20:01:04,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-09-03 20:01:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-09-03 20:01:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16120, Invalid=17552, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 20:01:04,557 INFO L87 Difference]: Start difference. First operand 668 states and 768 transitions. Second operand 184 states. [2019-09-03 20:01:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:15,334 INFO L93 Difference]: Finished difference Result 913 states and 1092 transitions. [2019-09-03 20:01:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-09-03 20:01:15,335 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 370 [2019-09-03 20:01:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:15,336 INFO L225 Difference]: With dead ends: 913 [2019-09-03 20:01:15,336 INFO L226 Difference]: Without dead ends: 907 [2019-09-03 20:01:15,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16250 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=16126, Invalid=17914, Unknown=0, NotChecked=0, Total=34040 [2019-09-03 20:01:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-09-03 20:01:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 670. [2019-09-03 20:01:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-03 20:01:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 770 transitions. [2019-09-03 20:01:15,341 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 770 transitions. Word has length 370 [2019-09-03 20:01:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:15,341 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 770 transitions. [2019-09-03 20:01:15,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-09-03 20:01:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 770 transitions. [2019-09-03 20:01:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-03 20:01:15,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:15,343 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 80, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:15,343 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1739054158, now seen corresponding path program 78 times [2019-09-03 20:01:15,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:15,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16220 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:01:17,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:17,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:17,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:18,187 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 20:01:18,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:18,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 185 conjunts are in the unsatisfiable core [2019-09-03 20:01:18,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16220 backedges. 0 proven. 16220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:21,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:21,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 183] total 185 [2019-09-03 20:01:21,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 185 states [2019-09-03 20:01:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2019-09-03 20:01:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16300, Invalid=17740, Unknown=0, NotChecked=0, Total=34040 [2019-09-03 20:01:21,828 INFO L87 Difference]: Start difference. First operand 670 states and 770 transitions. Second operand 185 states. [2019-09-03 20:01:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:35,605 INFO L93 Difference]: Finished difference Result 918 states and 1098 transitions. [2019-09-03 20:01:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-09-03 20:01:35,606 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 372 [2019-09-03 20:01:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:35,607 INFO L225 Difference]: With dead ends: 918 [2019-09-03 20:01:35,608 INFO L226 Difference]: Without dead ends: 912 [2019-09-03 20:01:35,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16452 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16306, Invalid=18104, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:01:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-03 20:01:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 672. [2019-09-03 20:01:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-09-03 20:01:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 772 transitions. [2019-09-03 20:01:35,614 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 772 transitions. Word has length 372 [2019-09-03 20:01:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:35,615 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 772 transitions. [2019-09-03 20:01:35,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 185 states. [2019-09-03 20:01:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 772 transitions. [2019-09-03 20:01:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-03 20:01:35,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:35,617 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 81, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:35,617 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -813898099, now seen corresponding path program 79 times [2019-09-03 20:01:35,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:35,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:01:38,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:38,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:38,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:38,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 186 conjunts are in the unsatisfiable core [2019-09-03 20:01:38,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 16380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:42,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:42,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 184] total 186 [2019-09-03 20:01:42,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-09-03 20:01:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-09-03 20:01:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16481, Invalid=17929, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:01:42,008 INFO L87 Difference]: Start difference. First operand 672 states and 772 transitions. Second operand 186 states. [2019-09-03 20:01:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:57,339 INFO L93 Difference]: Finished difference Result 923 states and 1104 transitions. [2019-09-03 20:01:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-09-03 20:01:57,340 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 374 [2019-09-03 20:01:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:57,341 INFO L225 Difference]: With dead ends: 923 [2019-09-03 20:01:57,341 INFO L226 Difference]: Without dead ends: 917 [2019-09-03 20:01:57,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16654 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=16487, Invalid=18295, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 20:01:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-03 20:01:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 674. [2019-09-03 20:01:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-03 20:01:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 774 transitions. [2019-09-03 20:01:57,348 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 774 transitions. Word has length 374 [2019-09-03 20:01:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:57,348 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 774 transitions. [2019-09-03 20:01:57,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-09-03 20:01:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 774 transitions. [2019-09-03 20:01:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-03 20:01:57,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:57,350 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 82, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:57,351 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash -797155672, now seen corresponding path program 80 times [2019-09-03 20:01:57,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:57,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16542 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:01:59,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:59,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:59,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:00,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:00,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:00,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 187 conjunts are in the unsatisfiable core [2019-09-03 20:02:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:03,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16542 backedges. 0 proven. 16542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:03,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:03,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 185] total 187 [2019-09-03 20:02:03,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 187 states [2019-09-03 20:02:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2019-09-03 20:02:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16663, Invalid=18119, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 20:02:03,791 INFO L87 Difference]: Start difference. First operand 674 states and 774 transitions. Second operand 187 states. [2019-09-03 20:02:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:15,447 INFO L93 Difference]: Finished difference Result 928 states and 1110 transitions. [2019-09-03 20:02:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-03 20:02:15,448 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 376 [2019-09-03 20:02:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:15,449 INFO L225 Difference]: With dead ends: 928 [2019-09-03 20:02:15,449 INFO L226 Difference]: Without dead ends: 922 [2019-09-03 20:02:15,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16856 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=16669, Invalid=18487, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:02:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-09-03 20:02:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 676. [2019-09-03 20:02:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-03 20:02:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 776 transitions. [2019-09-03 20:02:15,455 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 776 transitions. Word has length 376 [2019-09-03 20:02:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:15,455 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 776 transitions. [2019-09-03 20:02:15,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 187 states. [2019-09-03 20:02:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 776 transitions. [2019-09-03 20:02:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-03 20:02:15,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:15,457 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 83, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:15,458 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1887552509, now seen corresponding path program 81 times [2019-09-03 20:02:15,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:15,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16706 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:02:18,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:18,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:18,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:18,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2019-09-03 20:02:18,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:18,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:02:18,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16706 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:02:18,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 89 [2019-09-03 20:02:18,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:02:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:02:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3580, Invalid=4252, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:02:18,537 INFO L87 Difference]: Start difference. First operand 676 states and 776 transitions. Second operand 89 states. [2019-09-03 20:02:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:20,405 INFO L93 Difference]: Finished difference Result 17116 states and 17216 transitions. [2019-09-03 20:02:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:02:20,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 378 [2019-09-03 20:02:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:20,416 INFO L225 Difference]: With dead ends: 17116 [2019-09-03 20:02:20,416 INFO L226 Difference]: Without dead ends: 17110 [2019-09-03 20:02:20,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3586, Invalid=4424, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:02:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17110 states. [2019-09-03 20:02:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17110 to 673. [2019-09-03 20:02:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-03 20:02:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 772 transitions. [2019-09-03 20:02:20,466 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 772 transitions. Word has length 378 [2019-09-03 20:02:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:20,466 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 772 transitions. [2019-09-03 20:02:20,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:02:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 772 transitions. [2019-09-03 20:02:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-03 20:02:20,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:20,469 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 84, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:20,469 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1754885127, now seen corresponding path program 82 times [2019-09-03 20:02:20,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16674 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 20:02:23,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:23,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:23,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:23,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:23,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:23,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 188 conjunts are in the unsatisfiable core [2019-09-03 20:02:23,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16674 backedges. 0 proven. 16674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:27,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:27,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 186] total 189 [2019-09-03 20:02:27,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-03 20:02:27,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-03 20:02:27,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17030, Invalid=18502, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 20:02:27,006 INFO L87 Difference]: Start difference. First operand 673 states and 772 transitions. Second operand 189 states. [2019-09-03 20:02:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:41,492 INFO L93 Difference]: Finished difference Result 1106 states and 1291 transitions. [2019-09-03 20:02:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-03 20:02:41,493 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 378 [2019-09-03 20:02:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:41,494 INFO L225 Difference]: With dead ends: 1106 [2019-09-03 20:02:41,494 INFO L226 Difference]: Without dead ends: 1098 [2019-09-03 20:02:41,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17260 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=17036, Invalid=18874, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 20:02:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-03 20:02:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 680. [2019-09-03 20:02:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-03 20:02:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 780 transitions. [2019-09-03 20:02:41,503 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 780 transitions. Word has length 378 [2019-09-03 20:02:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:41,504 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 780 transitions. [2019-09-03 20:02:41,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-03 20:02:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 780 transitions. [2019-09-03 20:02:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-03 20:02:41,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:41,506 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 85, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:41,506 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 457959033, now seen corresponding path program 83 times [2019-09-03 20:02:41,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:41,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17040 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:02:44,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:44,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:44,699 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-03 20:02:44,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:44,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 190 conjunts are in the unsatisfiable core [2019-09-03 20:02:44,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17040 backedges. 0 proven. 17040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:48,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:48,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 188] total 190 [2019-09-03 20:02:48,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-09-03 20:02:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-09-03 20:02:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17215, Invalid=18695, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 20:02:48,375 INFO L87 Difference]: Start difference. First operand 680 states and 780 transitions. Second operand 190 states. [2019-09-03 20:03:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:02,581 INFO L93 Difference]: Finished difference Result 943 states and 1128 transitions. [2019-09-03 20:03:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-03 20:03:02,582 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 382 [2019-09-03 20:03:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:02,583 INFO L225 Difference]: With dead ends: 943 [2019-09-03 20:03:02,583 INFO L226 Difference]: Without dead ends: 937 [2019-09-03 20:03:02,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17462 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17221, Invalid=19069, Unknown=0, NotChecked=0, Total=36290 [2019-09-03 20:03:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-03 20:03:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 682. [2019-09-03 20:03:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-03 20:03:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 782 transitions. [2019-09-03 20:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 782 transitions. Word has length 382 [2019-09-03 20:03:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:02,589 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 782 transitions. [2019-09-03 20:03:02,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-09-03 20:03:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 782 transitions. [2019-09-03 20:03:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-03 20:03:02,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:02,591 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 86, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:02,591 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1686836116, now seen corresponding path program 84 times [2019-09-03 20:03:02,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:02,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17210 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:03:05,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:05,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:03:05,669 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-03 20:03:05,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:05,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 191 conjunts are in the unsatisfiable core [2019-09-03 20:03:05,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17210 backedges. 0 proven. 17210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:09,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:09,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 189] total 191 [2019-09-03 20:03:09,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 191 states [2019-09-03 20:03:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2019-09-03 20:03:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17401, Invalid=18889, Unknown=0, NotChecked=0, Total=36290 [2019-09-03 20:03:09,381 INFO L87 Difference]: Start difference. First operand 682 states and 782 transitions. Second operand 191 states. [2019-09-03 20:03:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:26,047 INFO L93 Difference]: Finished difference Result 948 states and 1134 transitions. [2019-09-03 20:03:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-03 20:03:26,047 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 384 [2019-09-03 20:03:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:26,049 INFO L225 Difference]: With dead ends: 948 [2019-09-03 20:03:26,049 INFO L226 Difference]: Without dead ends: 942 [2019-09-03 20:03:26,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17664 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17407, Invalid=19265, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 20:03:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-03 20:03:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 684. [2019-09-03 20:03:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-03 20:03:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 784 transitions. [2019-09-03 20:03:26,056 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 784 transitions. Word has length 384 [2019-09-03 20:03:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:26,056 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 784 transitions. [2019-09-03 20:03:26,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 191 states. [2019-09-03 20:03:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 784 transitions. [2019-09-03 20:03:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-03 20:03:26,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:26,058 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 87, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:26,058 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1521706479, now seen corresponding path program 85 times [2019-09-03 20:03:26,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:26,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:26,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17382 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:03:28,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:28,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:28,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:29,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 192 conjunts are in the unsatisfiable core [2019-09-03 20:03:29,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:32,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17382 backedges. 0 proven. 17382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:32,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:32,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 190] total 192 [2019-09-03 20:03:32,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-09-03 20:03:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-09-03 20:03:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17588, Invalid=19084, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 20:03:32,842 INFO L87 Difference]: Start difference. First operand 684 states and 784 transitions. Second operand 192 states. [2019-09-03 20:03:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:48,390 INFO L93 Difference]: Finished difference Result 953 states and 1140 transitions. [2019-09-03 20:03:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-09-03 20:03:48,392 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 386 [2019-09-03 20:03:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:48,393 INFO L225 Difference]: With dead ends: 953 [2019-09-03 20:03:48,393 INFO L226 Difference]: Without dead ends: 947 [2019-09-03 20:03:48,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17866 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=17594, Invalid=19462, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 20:03:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-03 20:03:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 686. [2019-09-03 20:03:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-03 20:03:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 786 transitions. [2019-09-03 20:03:48,399 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 786 transitions. Word has length 386 [2019-09-03 20:03:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:48,400 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 786 transitions. [2019-09-03 20:03:48,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-09-03 20:03:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 786 transitions. [2019-09-03 20:03:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-03 20:03:48,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:48,402 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 88, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:48,402 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1745915274, now seen corresponding path program 86 times [2019-09-03 20:03:48,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:03:51,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:51,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:51,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:51,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:51,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:51,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 193 conjunts are in the unsatisfiable core [2019-09-03 20:03:51,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:55,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:55,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:55,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 191] total 193 [2019-09-03 20:03:55,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 193 states [2019-09-03 20:03:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2019-09-03 20:03:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17776, Invalid=19280, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 20:03:55,256 INFO L87 Difference]: Start difference. First operand 686 states and 786 transitions. Second operand 193 states. [2019-09-03 20:04:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:11,015 INFO L93 Difference]: Finished difference Result 958 states and 1146 transitions. [2019-09-03 20:04:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-03 20:04:11,015 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 388 [2019-09-03 20:04:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:11,017 INFO L225 Difference]: With dead ends: 958 [2019-09-03 20:04:11,017 INFO L226 Difference]: Without dead ends: 952 [2019-09-03 20:04:11,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18068 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=17782, Invalid=19660, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 20:04:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-03 20:04:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 688. [2019-09-03 20:04:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-03 20:04:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 788 transitions. [2019-09-03 20:04:11,025 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 788 transitions. Word has length 388 [2019-09-03 20:04:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:11,025 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 788 transitions. [2019-09-03 20:04:11,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 193 states. [2019-09-03 20:04:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 788 transitions. [2019-09-03 20:04:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-03 20:04:11,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:11,027 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 89, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:11,027 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1832764827, now seen corresponding path program 87 times [2019-09-03 20:04:11,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:11,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17732 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:04:13,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:13,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:13,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:14,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2019-09-03 20:04:14,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:14,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 20:04:14,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17732 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-03 20:04:14,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 95 [2019-09-03 20:04:14,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:04:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:04:14,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:04:14,477 INFO L87 Difference]: Start difference. First operand 688 states and 788 transitions. Second operand 95 states. [2019-09-03 20:04:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:16,541 INFO L93 Difference]: Finished difference Result 18316 states and 18416 transitions. [2019-09-03 20:04:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:04:16,541 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 390 [2019-09-03 20:04:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:16,552 INFO L225 Difference]: With dead ends: 18316 [2019-09-03 20:04:16,552 INFO L226 Difference]: Without dead ends: 18310 [2019-09-03 20:04:16,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:04:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18310 states. [2019-09-03 20:04:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18310 to 685. [2019-09-03 20:04:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-03 20:04:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 784 transitions. [2019-09-03 20:04:16,604 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 784 transitions. Word has length 390 [2019-09-03 20:04:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:16,604 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 784 transitions. [2019-09-03 20:04:16,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:04:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 784 transitions. [2019-09-03 20:04:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-03 20:04:16,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:16,606 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 90, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:16,606 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1211608741, now seen corresponding path program 88 times [2019-09-03 20:04:16,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:16,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17712 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-03 20:04:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:19,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:19,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:19,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:19,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 194 conjunts are in the unsatisfiable core [2019-09-03 20:04:19,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17712 backedges. 0 proven. 17712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:23,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 192] total 195 [2019-09-03 20:04:23,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-09-03 20:04:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-09-03 20:04:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18155, Invalid=19675, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 20:04:23,537 INFO L87 Difference]: Start difference. First operand 685 states and 784 transitions. Second operand 195 states.