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-acceleration/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:42:44,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:42:44,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:42:44,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:42:44,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:42:44,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:42:44,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:42:44,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:42:44,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:42:44,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:42:44,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:42:44,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:42:44,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:42:44,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:42:44,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:42:44,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:42:44,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:42:44,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:42:44,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:42:44,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:42:44,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:42:44,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:42:44,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:42:44,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:42:44,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:42:44,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:42:44,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:42:44,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:42:44,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:42:44,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:42:44,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:42:44,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:42:44,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:42:44,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:42:44,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:42:44,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:42:44,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:42:44,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:42:44,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:42:44,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:42:44,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:42:44,327 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-05 11:42:44,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:42:44,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:42:44,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:42:44,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:42:44,352 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:42:44,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:42:44,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:42:44,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:42:44,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:42:44,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:42:44,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:42:44,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:42:44,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:42:44,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:42:44,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:42:44,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:42:44,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:42:44,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:42:44,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:42:44,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:42:44,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:42:44,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:42:44,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:42:44,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:42:44,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:42:44,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:42:44,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:42:44,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:42:44,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:42:44,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:42:44,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:42:44,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:42:44,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:42:44,411 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:42:44,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-05 11:42:44,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997245df7/a3fb515ff848464999f40a868180ab1d/FLAG66c76ac4d [2019-09-05 11:42:44,922 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:42:44,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-05 11:42:44,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997245df7/a3fb515ff848464999f40a868180ab1d/FLAG66c76ac4d [2019-09-05 11:42:45,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997245df7/a3fb515ff848464999f40a868180ab1d [2019-09-05 11:42:45,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:42:45,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:42:45,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:42:45,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:42:45,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:42:45,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45, skipping insertion in model container [2019-09-05 11:42:45,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,358 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:42:45,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:42:45,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:42:45,539 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:42:45,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:42:45,565 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:42:45,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45 WrapperNode [2019-09-05 11:42:45,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:42:45,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:42:45,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:42:45,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:42:45,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (1/1) ... [2019-09-05 11:42:45,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:42:45,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:42:45,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:42:45,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:42:45,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (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-05 11:42:45,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:42:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:42:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:42:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:42:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:42:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:42:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:42:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:42:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:42:45,890 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:42:45,891 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:42:45,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:42:45 BoogieIcfgContainer [2019-09-05 11:42:45,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:42:45,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:42:45,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:42:45,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:42:45,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:42:45" (1/3) ... [2019-09-05 11:42:45,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e9518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:42:45, skipping insertion in model container [2019-09-05 11:42:45,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:42:45" (2/3) ... [2019-09-05 11:42:45,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e9518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:42:45, skipping insertion in model container [2019-09-05 11:42:45,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:42:45" (3/3) ... [2019-09-05 11:42:45,901 INFO L109 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2019-09-05 11:42:45,911 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:42:45,919 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:42:45,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:42:45,967 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:42:45,968 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:42:45,968 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:42:45,968 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:42:45,968 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:42:45,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:42:45,969 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:42:45,969 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:42:45,969 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:42:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 11:42:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:42:45,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:45,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:45,995 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 11:42:46,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:46,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:46,214 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-05 11:42:46,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:42:46,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:42:46,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:42:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:42:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:42:46,241 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-05 11:42:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:46,292 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-05 11:42:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:42:46,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:42:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:46,308 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:42:46,309 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:42:46,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:42:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:42:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:42:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:42:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 11:42:46,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 11:42:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:46,383 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 11:42:46,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:42:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 11:42:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 11:42:46,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:46,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:46,386 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 11:42:46,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:46,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:46,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:46,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:46,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:42:46,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:46,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:42:46,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:46,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:42:46,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:42:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:42:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:42:46,698 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-05 11:42:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:46,721 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 11:42:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:42:46,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-05 11:42:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:46,723 INFO L225 Difference]: With dead ends: 18 [2019-09-05 11:42:46,723 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 11:42:46,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:42:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 11:42:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 11:42:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:42:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 11:42:46,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-05 11:42:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:46,730 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 11:42:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:42:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 11:42:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:42:46,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:46,731 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:46,732 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-05 11:42:46,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:46,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:46,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:46,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:46,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:46,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:46,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:46,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:42:46,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:46,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:46,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:42:46,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:42:46,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:42:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:42:46,929 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-05 11:42:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:46,960 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 11:42:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:42:46,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-05 11:42:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:46,962 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:42:46,962 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:42:46,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:42:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:42:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:42:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:42:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 11:42:46,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-05 11:42:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:46,968 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 11:42:46,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:42:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 11:42:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:42:46,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:46,969 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:46,969 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-05 11:42:46,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:47,088 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-05 11:42:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:47,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:42:47,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:47,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:42:47,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:42:47,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:42:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:42:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:42:47,157 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-05 11:42:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:47,210 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 11:42:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:42:47,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 11:42:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:47,211 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:42:47,212 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 11:42:47,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:42:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 11:42:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 11:42:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:42:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 11:42:47,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 11:42:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:47,218 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 11:42:47,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:42:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 11:42:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:42:47,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:47,219 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:47,219 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-05 11:42:47,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:47,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:47,369 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-05 11:42:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:47,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:47,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:47,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:42:47,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:47,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:42:47,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:42:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:42:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:42:47,450 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-05 11:42:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:47,499 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 11:42:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:42:47,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-05 11:42:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:47,501 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:42:47,501 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:42:47,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:42:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:42:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:42:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:42:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 11:42:47,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 11:42:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:47,522 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 11:42:47,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:42:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 11:42:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:42:47,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:47,524 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:47,525 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-05 11:42:47,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:47,646 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:42:47,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:42:47,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:47,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:42:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:42:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:42:47,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:42:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:42:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:42:47,734 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-05 11:42:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:47,794 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 11:42:47,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:42:47,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-05 11:42:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:47,796 INFO L225 Difference]: With dead ends: 22 [2019-09-05 11:42:47,798 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:42:47,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:42:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:42:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:42:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:42:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 11:42:47,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 11:42:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:47,803 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 11:42:47,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:42:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 11:42:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:42:47,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:47,806 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:47,806 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-05 11:42:47,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:47,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:47,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:47,985 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) [2019-09-05 11:42:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:48,017 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:42:48,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:48,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:42:48,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:48,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:42:48,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:42:48,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:42:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:42:48,056 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-05 11:42:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:48,128 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 11:42:48,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:42:48,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-05 11:42:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:48,131 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:42:48,131 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:42:48,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:42:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:42:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:42:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:42:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-05 11:42:48,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-05 11:42:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:48,139 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-05 11:42:48,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:42:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-05 11:42:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:42:48,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:48,140 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:48,140 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-05 11:42:48,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:48,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:42:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:48,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:42:48,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:48,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:42:48,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:42:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:42:48,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:42:48,374 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-05 11:42:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:48,461 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-05 11:42:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:42:48,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-05 11:42:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:48,464 INFO L225 Difference]: With dead ends: 24 [2019-09-05 11:42:48,464 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:42:48,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:42:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:42:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:42:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:42:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 11:42:48,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-05 11:42:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:48,470 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 11:42:48,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:42:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 11:42:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:42:48,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:48,471 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:48,471 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-05 11:42:48,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:48,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:48,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:48,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:42:48,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:42:48,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:42:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:42:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:42:48,699 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-05 11:42:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:48,798 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 11:42:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:42:48,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-05 11:42:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:48,800 INFO L225 Difference]: With dead ends: 25 [2019-09-05 11:42:48,800 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 11:42:48,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:42:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 11:42:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 11:42:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:42:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-05 11:42:48,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-05 11:42:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:48,807 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-05 11:42:48,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:42:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-05 11:42:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:42:48,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:48,809 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:48,810 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-05 11:42:48,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:48,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:48,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:48,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:49,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:42:49,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:49,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:42:49,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:49,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:42:49,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:42:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:42:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:42:49,145 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-05 11:42:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:49,242 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-05 11:42:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:42:49,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-05 11:42:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:49,244 INFO L225 Difference]: With dead ends: 26 [2019-09-05 11:42:49,245 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:42:49,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:42:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:42:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:42:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:42:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 11:42:49,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-05 11:42:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:49,254 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 11:42:49,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:42:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 11:42:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:42:49,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:49,255 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:49,257 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-05 11:42:49,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:49,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:49,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:49,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:49,450 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-05 11:42:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:42:49,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:49,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:49,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:42:49,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:42:49,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:42:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:42:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:42:49,518 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-05 11:42:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:49,622 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 11:42:49,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:42:49,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-05 11:42:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:49,624 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:42:49,624 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:42:49,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:42:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:42:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:42:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:42:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-05 11:42:49,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-05 11:42:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:49,629 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-05 11:42:49,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:42:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-05 11:42:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:42:49,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:49,630 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:49,630 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-05 11:42:49,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:49,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:49,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:49,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:42:49,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:49,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:42:49,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:49,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:42:49,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:42:49,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:42:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:42:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:42:49,969 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-05 11:42:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:50,087 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-05 11:42:50,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:42:50,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-05 11:42:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:50,089 INFO L225 Difference]: With dead ends: 28 [2019-09-05 11:42:50,089 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:42:50,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:42:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:42:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:42:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:42:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 11:42:50,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-05 11:42:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:50,095 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 11:42:50,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:42:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 11:42:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:42:50,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:50,096 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:50,096 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-05 11:42:50,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:50,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:50,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:50,294 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-05 11:42:50,313 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:42:50,358 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:42:50,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:50,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:42:50,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:50,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:50,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:42:50,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:42:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:42:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:42:50,395 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-05 11:42:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:50,537 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 11:42:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:42:50,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-05 11:42:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:50,541 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:42:50,541 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:42:50,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:42:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:42:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:42:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:42:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-05 11:42:50,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-05 11:42:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:50,546 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-05 11:42:50,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:42:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-05 11:42:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:42:50,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:50,547 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:50,547 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-05 11:42:50,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:50,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:50,743 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-05 11:42:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:50,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:42:50,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:50,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:50,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:42:50,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:42:50,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:42:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:42:50,843 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-05 11:42:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:51,033 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-05 11:42:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:42:51,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-05 11:42:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:51,034 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:42:51,035 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:42:51,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:42:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:42:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:42:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:42:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 11:42:51,040 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-05 11:42:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:51,040 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 11:42:51,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:42:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 11:42:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:42:51,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:51,042 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:51,042 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-05 11:42:51,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:51,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:51,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:51,263 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-05 11:42:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:51,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:51,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:51,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:42:51,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:51,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:51,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:42:51,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:42:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:42:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:42:51,355 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-05 11:42:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:51,539 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 11:42:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:42:51,539 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-05 11:42:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:51,540 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:42:51,540 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:42:51,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:42:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:42:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 11:42:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:42:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-05 11:42:51,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-05 11:42:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:51,545 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-05 11:42:51,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:42:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-05 11:42:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:42:51,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:51,546 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:51,547 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-05 11:42:51,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:51,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:51,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:51,802 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-05 11:42:51,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:52,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:42:52,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:52,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:42:52,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:52,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:42:52,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:42:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:42:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:42:52,139 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-05 11:42:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:52,366 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-05 11:42:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:42:52,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-05 11:42:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:52,368 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:42:52,368 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:42:52,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:42:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:42:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 11:42:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:42:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 11:42:52,373 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-05 11:42:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:52,373 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 11:42:52,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:42:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 11:42:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:42:52,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:52,374 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:52,375 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-05 11:42:52,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:52,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:52,638 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-05 11:42:52,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:42:52,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:52,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:52,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:42:52,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:52,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:52,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:42:52,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:42:52,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:42:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:42:52,731 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-05 11:42:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:52,929 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 11:42:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:42:52,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-05 11:42:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:52,930 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:42:52,931 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:42:52,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:42:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:42:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 11:42:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:42:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-05 11:42:52,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-05 11:42:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:52,937 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-05 11:42:52,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:42:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-05 11:42:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:42:52,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:52,938 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:52,938 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-05 11:42:52,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:42:53,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:53,245 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-05 11:42:53,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:10,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:43:10,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:10,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:43:10,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:43:10,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:43:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:43:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:43:10,145 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-05 11:43:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:10,384 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-05 11:43:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:43:10,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-05 11:43:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:10,386 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:43:10,386 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:43:10,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:43:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:43:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:43:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:43:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 11:43:10,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-05 11:43:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:10,391 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 11:43:10,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:43:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 11:43:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:43:10,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:10,392 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:10,392 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-05 11:43:10,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:10,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:10,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:10,667 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-05 11:43:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:10,919 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:43:10,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:10,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:43:10,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:43:10,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:43:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:43:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:43:10,984 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-05 11:43:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:11,295 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 11:43:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:43:11,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-05 11:43:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:11,296 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:43:11,296 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:43:11,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:43:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:43:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 11:43:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:43:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-05 11:43:11,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-05 11:43:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-05 11:43:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:43:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-05 11:43:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:43:11,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:11,302 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:11,302 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-05 11:43:11,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:11,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:11,606 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:11,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:43:11,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:43:11,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:43:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:43:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:43:11,686 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-05 11:43:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:11,977 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-05 11:43:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:43:11,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-05 11:43:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:11,979 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:43:11,979 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:43:11,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:43:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:43:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 11:43:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:43:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 11:43:11,984 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-05 11:43:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:11,985 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 11:43:11,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:43:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 11:43:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:43:11,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:11,986 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:11,986 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-05 11:43:11,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:11,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:11,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:12,370 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) [2019-09-05 11:43:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:12,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:12,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:12,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:43:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:12,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:12,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:43:12,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:43:12,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:43:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:43:12,485 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-05 11:43:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:12,803 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 11:43:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:43:12,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-05 11:43:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:12,804 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:43:12,804 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:43:12,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:43:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:43:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 11:43:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:43:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-05 11:43:12,812 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-05 11:43:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:12,812 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-05 11:43:12,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:43:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-05 11:43:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:43:12,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:12,817 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:12,817 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-05 11:43:12,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:13,182 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:14,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:43:14,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:14,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:43:14,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:43:14,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:43:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:43:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:43:14,130 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-05 11:43:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:14,483 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-05 11:43:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:43:14,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-05 11:43:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:14,484 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:43:14,484 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:43:14,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:43:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:43:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:43:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:43:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 11:43:14,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-05 11:43:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:14,489 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 11:43:14,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:43:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 11:43:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:43:14,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:14,490 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:14,490 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:14,491 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-05 11:43:14,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:14,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:14,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:14,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:14,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:14,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:14,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:14,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:14,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:14,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:14,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:43:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:14,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:43:14,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:43:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:43:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:43:14,953 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-05 11:43:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:15,328 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 11:43:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:43:15,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-05 11:43:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:15,329 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:43:15,330 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:43:15,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:43:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:43:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 11:43:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:43:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-05 11:43:15,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-05 11:43:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:15,335 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-05 11:43:15,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:43:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-05 11:43:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:43:15,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:15,336 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:15,336 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-05 11:43:15,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:15,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:15,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:36,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:43:36,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:36,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:43:36,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:36,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:43:36,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:43:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:43:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:43:36,643 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-05 11:43:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:37,071 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-05 11:43:37,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:43:37,072 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-05 11:43:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:37,073 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:43:37,073 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:43:37,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:43:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:43:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 11:43:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:43:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 11:43:37,079 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-05 11:43:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:37,079 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 11:43:37,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:43:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 11:43:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:43:37,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:37,081 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:37,081 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-05 11:43:37,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:37,708 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-05 11:43:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:42,894 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:43:42,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:42,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:43:42,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:42,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:42,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:43:42,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:43:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:43:42,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:43:42,973 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-05 11:43:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:43,399 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 11:43:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:43:43,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-05 11:43:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:43,400 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:43:43,400 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:43:43,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:43:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:43:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 11:43:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:43:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-05 11:43:43,406 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-05 11:43:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:43,406 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-05 11:43:43,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:43:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-05 11:43:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:43:43,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:43,407 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:43,407 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:43,408 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-05 11:43:43,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:43,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:43,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:43,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:43,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 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-05 11:43:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:43,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:43:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:43,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:43,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:43:43,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:43:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:43:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:43:43,970 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-05 11:43:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:44,447 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-05 11:43:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:43:44,448 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-05 11:43:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:44,449 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:43:44,449 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:43:44,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:43:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:43:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 11:43:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:43:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 11:43:44,454 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-05 11:43:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:44,455 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 11:43:44,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:43:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 11:43:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:43:44,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:44,462 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:44,462 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-05 11:43:44,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:44,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:44,928 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-05 11:43:44,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:44,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:44,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:44,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:43:44,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:45,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:43:45,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:43:45,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:43:45,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:43:45,028 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-05 11:43:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:45,541 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 11:43:45,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:43:45,542 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-05 11:43:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:45,543 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:43:45,543 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:43:45,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:43:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:43:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-05 11:43:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 11:43:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-05 11:43:45,548 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-05 11:43:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:45,548 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-05 11:43:45,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:43:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-05 11:43:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:43:45,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:45,549 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:45,550 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-05 11:43:45,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:45,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:46,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:46,084 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) [2019-09-05 11:43:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:48,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:43:48,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:48,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:43:48,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:48,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:43:48,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:43:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:43:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:43:48,574 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-05 11:43:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:49,120 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-05 11:43:49,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:43:49,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-05 11:43:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:49,121 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:43:49,121 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:43:49,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:43:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:43:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 11:43:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:43:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 11:43:49,126 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-05 11:43:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:49,126 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 11:43:49,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:43:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 11:43:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:43:49,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:49,127 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:49,127 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-05 11:43:49,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:49,638 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-05 11:43:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:43:49,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:49,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:49,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:43:49,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:49,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:43:49,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:43:49,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:43:49,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:43:49,719 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-05 11:43:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:50,345 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 11:43:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:43:50,348 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-05 11:43:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:50,349 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:43:50,349 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:43:50,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:43:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:43:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 11:43:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:43:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-05 11:43:50,353 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-05 11:43:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:50,353 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-05 11:43:50,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:43:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-05 11:43:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:43:50,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:50,354 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:50,354 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-05 11:43:50,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:50,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:50,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:50,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:50,895 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-05 11:43:50,905 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:45:19,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 11:45:19,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:19,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:45:19,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:20,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:20,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:45:20,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:45:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:45:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:45:20,046 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-05 11:45:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:20,682 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 11:45:20,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:45:20,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-05 11:45:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:20,683 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:45:20,683 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:45:20,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:45:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:45:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 11:45:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:45:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 11:45:20,689 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-05 11:45:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:20,689 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 11:45:20,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:45:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 11:45:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:45:20,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:20,690 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:20,690 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-05 11:45:20,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:20,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:21,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:21,381 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-05 11:45:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:46:18,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-05 11:46:18,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:18,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 11:46:18,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:18,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:18,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 11:46:18,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:46:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:46:18,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:46:18,230 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-05 11:46:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:18,899 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 11:46:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:46:18,900 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-05 11:46:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:18,900 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:46:18,901 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:46:18,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:46:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:46:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 11:46:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:46:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-05 11:46:18,905 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-05 11:46:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:18,906 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-05 11:46:18,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:46:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-05 11:46:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:46:18,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:18,907 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:18,907 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-05 11:46:18,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:18,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:19,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:19,512 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-05 11:46:19,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:19,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 11:46:19,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:19,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:19,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 11:46:19,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:46:19,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:46:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:46:19,618 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-05 11:46:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:20,321 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-05 11:46:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:46:20,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-05 11:46:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:20,323 INFO L225 Difference]: With dead ends: 48 [2019-09-05 11:46:20,323 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:46:20,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:46:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:46:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 11:46:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:46:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 11:46:20,328 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-05 11:46:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:20,328 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 11:46:20,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:46:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 11:46:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:46:20,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:20,329 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:20,329 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-05 11:46:20,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:20,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:21,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:21,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 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-05 11:46:21,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:46:21,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:21,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:21,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 11:46:21,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:21,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:21,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-05 11:46:21,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:46:21,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:46:21,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:46:21,129 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-05 11:46:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:21,888 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 11:46:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:46:21,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-05 11:46:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:21,890 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:46:21,890 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 11:46:21,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:46:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 11:46:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 11:46:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:46:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-05 11:46:21,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-05 11:46:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:21,894 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-05 11:46:21,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:46:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-05 11:46:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:46:21,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:21,895 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:21,896 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-05 11:46:21,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:21,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:21,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:22,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:22,564 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-05 11:46:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:46:46,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 11:46:46,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:47,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 11:46:47,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:47,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:47,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-05 11:46:47,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:46:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:46:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:46:47,267 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-05 11:46:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:48,072 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-05 11:46:48,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:46:48,072 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-05 11:46:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:48,073 INFO L225 Difference]: With dead ends: 50 [2019-09-05 11:46:48,073 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 11:46:48,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:46:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 11:46:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 11:46:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:46:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 11:46:48,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-05 11:46:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:48,077 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 11:46:48,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:46:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 11:46:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:46:48,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:48,078 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:48,079 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-05 11:46:48,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:48,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:48,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:48,848 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-05 11:46:48,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:46:48,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:46:48,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:48,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 11:46:48,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:48,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:48,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 11:46:48,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:46:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:46:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:46:48,948 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-05 11:46:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:49,778 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 11:46:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:46:49,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-05 11:46:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:49,779 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:46:49,779 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 11:46:49,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:46:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 11:46:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-05 11:46:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:46:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-05 11:46:49,787 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-05 11:46:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:49,787 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-05 11:46:49,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:46:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-05 11:46:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 11:46:49,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:49,788 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:49,788 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-05 11:46:49,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:49,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:49,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:50,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:50,742 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-05 11:46:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:48:36,589 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-05 11:48:36,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:36,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-05 11:48:36,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-05 11:48:36,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:48:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:48:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:48:36,710 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-05 11:48:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:37,604 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-05 11:48:37,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 11:48:37,605 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-05 11:48:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:37,605 INFO L225 Difference]: With dead ends: 52 [2019-09-05 11:48:37,606 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 11:48:37,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:48:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 11:48:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-05 11:48:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 11:48:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-05 11:48:37,610 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-05 11:48:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:37,610 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-05 11:48:37,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:48:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-05 11:48:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:48:37,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:37,611 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:37,612 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-05 11:48:37,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:37,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:38,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:38,385 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-05 11:48:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:49:08,057 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:49:08,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 11:49:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:08,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:08,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-05 11:49:08,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:49:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:49:08,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:49:08,175 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 40 states. [2019-09-05 11:49:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:09,068 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-05 11:49:09,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:49:09,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2019-09-05 11:49:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:09,070 INFO L225 Difference]: With dead ends: 53 [2019-09-05 11:49:09,070 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:49:09,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:49:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:49:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-05 11:49:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 11:49:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-05 11:49:09,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-05 11:49:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:09,073 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-05 11:49:09,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:49:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-05 11:49:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:49:09,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:09,074 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:09,074 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 37 times [2019-09-05 11:49:09,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:09,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:09,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:09,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:09,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:09,953 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-05 11:49:09,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:09,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 11:49:09,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:10,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:10,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-05 11:49:10,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:49:10,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:49:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:49:10,064 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-05 11:49:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:10,993 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-05 11:49:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:49:10,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-05 11:49:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:10,994 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:49:10,994 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:49:10,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:49:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:49:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-05 11:49:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 11:49:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-05 11:49:11,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-05 11:49:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:11,000 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-05 11:49:11,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:49:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-05 11:49:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:49:11,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:11,001 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:11,001 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash -572484514, now seen corresponding path program 38 times [2019-09-05 11:49:11,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:11,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:11,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:11,860 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-05 11:49:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:49:11,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:49:11,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:11,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-05 11:49:11,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:11,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:11,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-05 11:49:11,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 11:49:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 11:49:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:49:11,996 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 42 states. [2019-09-05 11:49:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:13,018 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-05 11:49:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 11:49:13,018 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 48 [2019-09-05 11:49:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:13,019 INFO L225 Difference]: With dead ends: 55 [2019-09-05 11:49:13,019 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 11:49:13,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:49:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 11:49:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-05 11:49:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:49:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-05 11:49:13,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-09-05 11:49:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:13,024 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-05 11:49:13,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 11:49:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-05 11:49:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:49:13,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:13,025 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:13,025 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -530689487, now seen corresponding path program 39 times [2019-09-05 11:49:13,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:13,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:13,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:13,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:13,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:13,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:13,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:49:13,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:03,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 11:50:03,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:04,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 11:50:04,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:04,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:04,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-05 11:50:04,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:50:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:50:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:50:04,381 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 43 states. [2019-09-05 11:50:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:05,448 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-05 11:50:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:50:05,448 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-09-05 11:50:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:05,449 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:50:05,449 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:50:05,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:50:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:50:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-05 11:50:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 11:50:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-05 11:50:05,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-09-05 11:50:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:05,454 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-05 11:50:05,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:50:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-05 11:50:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:50:05,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:05,455 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:05,455 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 764956350, now seen corresponding path program 40 times [2019-09-05 11:50:05,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:05,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:05,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:05,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:06,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:06,544 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-05 11:50:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:50:06,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:50:06,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:06,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 11:50:06,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:06,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:06,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-05 11:50:06,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:50:06,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:50:06,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:50:06,642 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 44 states. [2019-09-05 11:50:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:07,751 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-05 11:50:07,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 11:50:07,752 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2019-09-05 11:50:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:07,753 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:50:07,753 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 11:50:07,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:50:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 11:50:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-05 11:50:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 11:50:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-05 11:50:07,757 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-09-05 11:50:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:07,758 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-05 11:50:07,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:50:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-05 11:50:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 11:50:07,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:07,759 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:07,759 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2019695663, now seen corresponding path program 41 times [2019-09-05 11:50:07,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:08,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:08,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:50:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:52:34,573 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-05 11:52:34,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:34,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-05 11:52:34,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:34,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:34,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-05 11:52:34,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:52:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:52:34,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:52:34,994 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 45 states. [2019-09-05 11:52:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:36,121 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-05 11:52:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 11:52:36,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-05 11:52:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:36,123 INFO L225 Difference]: With dead ends: 58 [2019-09-05 11:52:36,123 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 11:52:36,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:52:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 11:52:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-05 11:52:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 11:52:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-05 11:52:36,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-09-05 11:52:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:36,128 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-05 11:52:36,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:52:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-05 11:52:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:52:36,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:36,128 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:36,129 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:36,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1850405150, now seen corresponding path program 42 times [2019-09-05 11:52:36,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:36,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:36,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:37,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:37,111 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-05 11:52:37,121 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:53:59,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-05 11:53:59,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:00,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 11:54:00,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:00,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:00,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-05 11:54:00,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:54:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:54:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:54:00,191 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 46 states. [2019-09-05 11:54:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:01,408 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-05 11:54:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:54:01,410 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-09-05 11:54:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:01,411 INFO L225 Difference]: With dead ends: 59 [2019-09-05 11:54:01,411 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 11:54:01,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:54:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 11:54:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-05 11:54:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 11:54:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-05 11:54:01,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-09-05 11:54:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:01,415 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-05 11:54:01,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:54:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-05 11:54:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-05 11:54:01,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:01,415 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:01,415 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1564446065, now seen corresponding path program 43 times [2019-09-05 11:54:01,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:01,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:01,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:02,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:02,884 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-05 11:54:02,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:54:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:02,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 11:54:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:03,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:03,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-05 11:54:03,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:54:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:54:03,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:54:03,002 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 47 states. [2019-09-05 11:54:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:04,235 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-05 11:54:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 11:54:04,235 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 53 [2019-09-05 11:54:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:04,236 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:54:04,236 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 11:54:04,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:54:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 11:54:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-05 11:54:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:54:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-05 11:54:04,241 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-09-05 11:54:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:04,241 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-05 11:54:04,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:54:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-05 11:54:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:54:04,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:04,242 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:04,242 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1289649022, now seen corresponding path program 44 times [2019-09-05 11:54:04,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:04,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:04,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:04,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:54:04,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:05,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:05,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:54:05,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:05,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:54:05,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:05,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-05 11:54:05,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:05,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-05 11:54:05,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 11:54:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 11:54:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:54:05,557 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 48 states. [2019-09-05 11:54:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:06,894 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-05 11:54:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 11:54:06,894 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-05 11:54:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:06,895 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:54:06,895 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 11:54:06,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:54:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 11:54:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-05 11:54:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:54:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-05 11:54:06,899 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-09-05 11:54:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:06,899 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-05 11:54:06,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 11:54:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-05 11:54:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:54:06,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:06,900 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:06,900 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1360875281, now seen corresponding path program 45 times [2019-09-05 11:54:06,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:06,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:07,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:07,972 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-05 11:54:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:54:35,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 11:54:35,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:35,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 11:54:35,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:35,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:35,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-05 11:54:35,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:54:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:54:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:54:35,903 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 49 states. [2019-09-05 11:54:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:37,275 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-05 11:54:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 11:54:37,276 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-09-05 11:54:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:37,277 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:54:37,277 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:54:37,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:54:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:54:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-05 11:54:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:54:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-05 11:54:37,281 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-09-05 11:54:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-05 11:54:37,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:54:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-05 11:54:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:54:37,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:37,283 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:37,283 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 46 times [2019-09-05 11:54:37,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:37,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:37,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:37,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:37,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:38,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:38,422 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-05 11:54:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:54:38,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:54:38,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:38,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 11:54:38,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:38,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:38,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-05 11:54:38,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:54:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:54:38,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:54:38,536 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 50 states. [2019-09-05 11:54:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:39,957 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-05 11:54:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:54:39,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-09-05 11:54:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:39,958 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:54:39,958 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 11:54:39,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:54:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 11:54:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-05 11:54:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 11:54:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-05 11:54:39,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-09-05 11:54:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:39,963 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-05 11:54:39,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:54:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-05 11:54:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 11:54:39,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:39,964 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:39,964 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash -997119823, now seen corresponding path program 47 times [2019-09-05 11:54:39,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:39,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:39,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:41,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:41,173 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-05 11:54:41,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1