java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:28:44,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:28:44,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:28:44,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:28:44,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:28:44,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:28:44,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:28:44,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:28:44,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:28:44,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:28:44,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:28:44,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:28:44,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:28:44,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:28:44,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:28:44,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:28:44,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:28:44,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:28:44,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:28:44,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:28:45,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:28:45,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:28:45,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:28:45,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:28:45,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:28:45,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:28:45,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:28:45,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:28:45,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:28:45,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:28:45,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:28:45,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:28:45,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:28:45,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:28:45,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:28:45,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:28:45,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:28:45,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:28:45,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:28:45,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:28:45,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:28:45,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:28:45,038 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:28:45,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:28:45,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:28:45,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:28:45,042 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:28:45,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:28:45,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:28:45,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:28:45,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:28:45,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:28:45,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:28:45,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:28:45,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:28:45,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:28:45,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:28:45,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:28:45,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:28:45,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:28:45,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:28:45,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:28:45,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:28:45,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:45,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:28:45,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:28:45,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:28:45,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:28:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:28:45,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:28:45,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:28:45,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:28:45,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:28:45,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:28:45,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:28:45,116 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:28:45,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-01 22:28:45,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5e83f0a/973a9efa49f44fb2b474557d7b985575/FLAG98a316107 [2019-10-01 22:28:45,645 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:28:45,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-01 22:28:45,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5e83f0a/973a9efa49f44fb2b474557d7b985575/FLAG98a316107 [2019-10-01 22:28:46,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5e83f0a/973a9efa49f44fb2b474557d7b985575 [2019-10-01 22:28:46,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:28:46,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:28:46,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:46,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:28:46,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:28:46,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ad8be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46, skipping insertion in model container [2019-10-01 22:28:46,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,100 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:28:46,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:28:46,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:46,366 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:28:46,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:46,510 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:28:46,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46 WrapperNode [2019-10-01 22:28:46,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:46,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:28:46,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:28:46,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:28:46,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... [2019-10-01 22:28:46,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:28:46,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:28:46,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:28:46,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:28:46,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:28:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:28:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:28:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:28:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:28:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:28:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:28:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:28:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:28:46,912 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:28:46,912 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-01 22:28:46,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:46 BoogieIcfgContainer [2019-10-01 22:28:46,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:28:46,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:28:46,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:28:46,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:28:46,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:28:46" (1/3) ... [2019-10-01 22:28:46,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2c340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:46, skipping insertion in model container [2019-10-01 22:28:46,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:46" (2/3) ... [2019-10-01 22:28:46,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2c340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:46, skipping insertion in model container [2019-10-01 22:28:46,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:46" (3/3) ... [2019-10-01 22:28:46,922 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-2.i [2019-10-01 22:28:46,933 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:28:46,940 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:28:46,973 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:28:47,008 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:28:47,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:28:47,010 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:28:47,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:28:47,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:28:47,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:28:47,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:28:47,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:28:47,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:28:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:28:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:47,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,041 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1296691801, now seen corresponding path program 1 times [2019-10-01 22:28:47,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:47,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:47,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:28:47,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:28:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:28:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:47,201 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:28:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,223 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-10-01 22:28:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:28:47,224 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:28:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,231 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:28:47,231 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:28:47,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:28:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:28:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:28:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 22:28:47,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-10-01 22:28:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,278 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 22:28:47,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:28:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 22:28:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:47,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,280 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1547542812, now seen corresponding path program 1 times [2019-10-01 22:28:47,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:47,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:47,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:47,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,338 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 22:28:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,376 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:28:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:47,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:28:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,381 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:28:47,381 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:28:47,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:28:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:28:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:28:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 22:28:47,389 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2019-10-01 22:28:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,389 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 22:28:47,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 22:28:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:28:47,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1387426810, now seen corresponding path program 1 times [2019-10-01 22:28:47,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:47,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:47,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:47,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:47,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,477 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-01 22:28:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,496 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-01 22:28:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:47,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 22:28:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,500 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:28:47,500 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:28:47,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:28:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 22:28:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:28:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-01 22:28:47,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2019-10-01 22:28:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,510 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-01 22:28:47,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-01 22:28:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:28:47,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,512 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1108929549, now seen corresponding path program 1 times [2019-10-01 22:28:47,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:47,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:47,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:47,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,571 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2019-10-01 22:28:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,616 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-01 22:28:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:47,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 22:28:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,619 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:28:47,619 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:47,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-01 22:28:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:28:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-10-01 22:28:47,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 20 [2019-10-01 22:28:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-10-01 22:28:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-10-01 22:28:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:28:47,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2055572838, now seen corresponding path program 1 times [2019-10-01 22:28:47,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:47,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:47,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:28:47,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:28:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:28:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:47,809 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 5 states. [2019-10-01 22:28:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,854 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-01 22:28:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:28:47,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-01 22:28:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,856 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:28:47,856 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:47,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-01 22:28:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:28:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-01 22:28:47,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 23 [2019-10-01 22:28:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,871 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-01 22:28:47,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:28:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-01 22:28:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:28:47,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,876 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,876 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash 442145592, now seen corresponding path program 2 times [2019-10-01 22:28:47,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:47,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:48,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:48,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:48,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:28:48,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:28:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:28:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:48,063 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-01 22:28:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,105 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-01 22:28:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:28:48,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 22:28:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,109 INFO L225 Difference]: With dead ends: 60 [2019-10-01 22:28:48,110 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 22:28:48,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 22:28:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-01 22:28:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:28:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-10-01 22:28:48,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 25 [2019-10-01 22:28:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,119 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-10-01 22:28:48,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:28:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-10-01 22:28:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:28:48,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,120 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash -137161642, now seen corresponding path program 3 times [2019-10-01 22:28:48,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:48,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:48,240 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:48,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:48,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:28:48,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:28:48,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:48,325 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 8 states. [2019-10-01 22:28:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,423 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-01 22:28:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:28:48,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 22:28:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,426 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:28:48,427 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:28:48,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:28:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-10-01 22:28:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:28:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-01 22:28:48,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2019-10-01 22:28:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,434 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-01 22:28:48,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-01 22:28:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:28:48,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,436 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,436 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -890436781, now seen corresponding path program 4 times [2019-10-01 22:28:48,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:48,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:48,514 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:48,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:48,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:28:48,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:48,603 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 8 states. [2019-10-01 22:28:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,646 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-01 22:28:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:28:48,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-01 22:28:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,648 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:28:48,648 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:28:48,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:28:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-01 22:28:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 22:28:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-01 22:28:48,657 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 32 [2019-10-01 22:28:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,659 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-01 22:28:48,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-01 22:28:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:28:48,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,663 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,663 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -250762123, now seen corresponding path program 5 times [2019-10-01 22:28:48,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:48,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:48,758 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:48,784 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:48,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-01 22:28:48,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 22:28:48,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:28:48,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:48,852 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 11 states. [2019-10-01 22:28:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,940 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-10-01 22:28:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:48,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-10-01 22:28:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,942 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:28:48,942 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:28:48,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:28:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-10-01 22:28:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:28:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-01 22:28:48,950 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 34 [2019-10-01 22:28:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,950 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-01 22:28:48,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-01 22:28:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:28:48,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,952 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,952 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1537034928, now seen corresponding path program 6 times [2019-10-01 22:28:48,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:49,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:49,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:49,120 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:49,165 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:28:49,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:49,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:28:49,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-01 22:28:49,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:28:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:28:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:49,251 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 13 states. [2019-10-01 22:28:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:49,349 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-10-01 22:28:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:49,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-10-01 22:28:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:49,351 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:28:49,351 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:49,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2019-10-01 22:28:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 22:28:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-10-01 22:28:49,359 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 39 [2019-10-01 22:28:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:49,371 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-10-01 22:28:49,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:28:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-10-01 22:28:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:28:49,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:49,375 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:49,375 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 747611417, now seen corresponding path program 7 times [2019-10-01 22:28:49,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:49,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:49,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:49,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:49,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:49,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:28:49,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:49,607 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 11 states. [2019-10-01 22:28:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:49,656 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2019-10-01 22:28:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:28:49,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-10-01 22:28:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:49,657 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:28:49,657 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:28:49,658 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:28:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-01 22:28:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:28:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-01 22:28:49,671 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2019-10-01 22:28:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:49,671 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-01 22:28:49,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-01 22:28:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:28:49,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:49,676 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:49,677 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1331800891, now seen corresponding path program 8 times [2019-10-01 22:28:49,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:49,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:49,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:49,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:49,815 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:49,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:49,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:49,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:49,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:49,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:49,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:28:49,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:28:49,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:28:49,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:28:49,914 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 12 states. [2019-10-01 22:28:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:49,970 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-10-01 22:28:49,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:49,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-10-01 22:28:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:49,972 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:28:49,972 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:49,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:28:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-01 22:28:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 22:28:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-01 22:28:49,985 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 46 [2019-10-01 22:28:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:49,985 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-01 22:28:49,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:28:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-01 22:28:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 22:28:49,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:49,988 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:49,989 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash 97169629, now seen corresponding path program 9 times [2019-10-01 22:28:49,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:50,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:50,143 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:50,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:28:50,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:50,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:50,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:28:50,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:50,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-10-01 22:28:50,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:28:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:28:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:50,311 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 17 states. [2019-10-01 22:28:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:50,417 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2019-10-01 22:28:50,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:28:50,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-10-01 22:28:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:50,418 INFO L225 Difference]: With dead ends: 118 [2019-10-01 22:28:50,418 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:28:50,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:28:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-10-01 22:28:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 22:28:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2019-10-01 22:28:50,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 48 [2019-10-01 22:28:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:50,426 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2019-10-01 22:28:50,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:28:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2019-10-01 22:28:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:28:50,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:50,427 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:50,427 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash 830729064, now seen corresponding path program 10 times [2019-10-01 22:28:50,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:50,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:50,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:50,577 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:50,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:50,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:50,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:50,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:50,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:28:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:28:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:28:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:50,670 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 14 states. [2019-10-01 22:28:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:50,717 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-10-01 22:28:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:50,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-10-01 22:28:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:50,719 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:28:50,719 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 22:28:50,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 22:28:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-01 22:28:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:28:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-10-01 22:28:50,725 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 53 [2019-10-01 22:28:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:50,726 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-10-01 22:28:50,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:28:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-10-01 22:28:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:28:50,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:50,727 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:50,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1163504518, now seen corresponding path program 11 times [2019-10-01 22:28:50,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:50,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:50,871 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-10-01 22:28:50,936 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:28:50,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:50,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:28:50,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:28:51,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:51,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-10-01 22:28:51,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:28:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:28:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:51,024 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 20 states. [2019-10-01 22:28:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:51,157 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2019-10-01 22:28:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:28:51,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-10-01 22:28:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:51,159 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:28:51,159 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:28:51,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:28:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-10-01 22:28:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 22:28:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-10-01 22:28:51,166 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 55 [2019-10-01 22:28:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:51,166 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-10-01 22:28:51,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:28:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-10-01 22:28:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 22:28:51,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:51,167 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:51,168 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -264767709, now seen corresponding path program 12 times [2019-10-01 22:28:51,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-01 22:28:51,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:51,330 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:51,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:51,446 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:28:51,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:51,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:28:51,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:28:51,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:51,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-10-01 22:28:51,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:51,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:51,575 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 22 states. [2019-10-01 22:28:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:51,694 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2019-10-01 22:28:51,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:28:51,697 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-10-01 22:28:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:51,698 INFO L225 Difference]: With dead ends: 148 [2019-10-01 22:28:51,698 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:28:51,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:28:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-10-01 22:28:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:28:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2019-10-01 22:28:51,709 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 60 [2019-10-01 22:28:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:51,709 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-10-01 22:28:51,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2019-10-01 22:28:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:28:51,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:51,710 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:51,711 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 980957794, now seen corresponding path program 13 times [2019-10-01 22:28:51,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:51,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:51,889 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:51,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:28:51,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:52,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:28:52,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:28:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:28:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:52,008 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 17 states. [2019-10-01 22:28:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:52,081 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-10-01 22:28:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:28:52,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-10-01 22:28:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:52,085 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:28:52,085 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 22:28:52,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 22:28:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-01 22:28:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:28:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-10-01 22:28:52,101 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 65 [2019-10-01 22:28:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:52,102 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-10-01 22:28:52,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:28:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-10-01 22:28:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:28:52,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:52,106 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:52,106 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1862843776, now seen corresponding path program 14 times [2019-10-01 22:28:52,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:52,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:52,307 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:52,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:52,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:52,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:52,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:28:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:52,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:28:52,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:28:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:28:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:52,439 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 18 states. [2019-10-01 22:28:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:52,493 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2019-10-01 22:28:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:28:52,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-10-01 22:28:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:52,495 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:28:52,495 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:28:52,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:28:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 22:28:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:28:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-01 22:28:52,499 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 67 [2019-10-01 22:28:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:52,500 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-01 22:28:52,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:28:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-01 22:28:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:28:52,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:52,501 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:52,501 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1048252130, now seen corresponding path program 15 times [2019-10-01 22:28:52,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:52,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:52,682 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:52,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:28:52,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:52,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:52,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-01 22:28:52,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:52,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 26 [2019-10-01 22:28:52,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:28:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:28:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:52,944 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 26 states. [2019-10-01 22:28:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:53,076 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2019-10-01 22:28:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:28:53,078 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-10-01 22:28:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:53,079 INFO L225 Difference]: With dead ends: 166 [2019-10-01 22:28:53,080 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:28:53,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:28:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2019-10-01 22:28:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:28:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2019-10-01 22:28:53,085 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 69 [2019-10-01 22:28:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:53,085 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2019-10-01 22:28:53,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:28:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2019-10-01 22:28:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 22:28:53,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:53,087 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:53,087 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1331337461, now seen corresponding path program 16 times [2019-10-01 22:28:53,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:53,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:53,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 22:28:53,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:53,291 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:53,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:53,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:53,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:53,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 22:28:53,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:53,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-10-01 22:28:53,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:28:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:28:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:53,541 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 28 states. [2019-10-01 22:28:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:53,705 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2019-10-01 22:28:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:28:53,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2019-10-01 22:28:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:53,706 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:28:53,706 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 22:28:53,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 22:28:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-10-01 22:28:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:28:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2019-10-01 22:28:53,712 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 74 [2019-10-01 22:28:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:53,713 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2019-10-01 22:28:53,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:28:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2019-10-01 22:28:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 22:28:53,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:53,714 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:53,714 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 261485818, now seen corresponding path program 17 times [2019-10-01 22:28:53,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:53,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:28:53,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:53,944 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:54,130 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:28:54,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:54,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:28:54,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-01 22:28:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:54,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2019-10-01 22:28:54,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:28:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:28:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:54,293 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 30 states. [2019-10-01 22:28:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:54,425 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2019-10-01 22:28:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:28:54,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2019-10-01 22:28:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:54,427 INFO L225 Difference]: With dead ends: 194 [2019-10-01 22:28:54,427 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 22:28:54,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 22:28:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2019-10-01 22:28:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 22:28:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2019-10-01 22:28:54,433 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 79 [2019-10-01 22:28:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:54,433 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2019-10-01 22:28:54,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:28:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2019-10-01 22:28:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:28:54,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:54,435 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:54,435 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1674935505, now seen corresponding path program 18 times [2019-10-01 22:28:54,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:54,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:54,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:54,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:54,675 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:55,348 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:28:55,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:55,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:28:55,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:55,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:28:55,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:55,399 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand 22 states. [2019-10-01 22:28:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:55,470 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2019-10-01 22:28:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:28:55,470 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2019-10-01 22:28:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:55,472 INFO L225 Difference]: With dead ends: 198 [2019-10-01 22:28:55,472 INFO L226 Difference]: Without dead ends: 122 [2019-10-01 22:28:55,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-01 22:28:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-10-01 22:28:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 22:28:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2019-10-01 22:28:55,478 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 84 [2019-10-01 22:28:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:55,478 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2019-10-01 22:28:55,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2019-10-01 22:28:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 22:28:55,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:55,481 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:55,481 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1933852497, now seen corresponding path program 19 times [2019-10-01 22:28:55,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:55,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:55,768 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:55,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:55,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:28:55,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:55,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:55,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:28:55,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:28:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:28:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:55,884 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 23 states. [2019-10-01 22:28:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:55,958 INFO L93 Difference]: Finished difference Result 200 states and 248 transitions. [2019-10-01 22:28:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:28:55,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-10-01 22:28:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:55,960 INFO L225 Difference]: With dead ends: 200 [2019-10-01 22:28:55,960 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 22:28:55,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 22:28:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-10-01 22:28:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 22:28:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2019-10-01 22:28:55,969 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 86 [2019-10-01 22:28:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:55,969 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2019-10-01 22:28:55,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:28:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2019-10-01 22:28:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-01 22:28:55,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:55,971 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:55,971 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -354452749, now seen corresponding path program 20 times [2019-10-01 22:28:55,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:56,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:56,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:56,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:56,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:56,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:28:56,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:56,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:56,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:28:56,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:28:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:28:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:28:56,383 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 24 states. [2019-10-01 22:28:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:56,467 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2019-10-01 22:28:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:28:56,468 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2019-10-01 22:28:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:56,470 INFO L225 Difference]: With dead ends: 202 [2019-10-01 22:28:56,470 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 22:28:56,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:28:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 22:28:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 22:28:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:28:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2019-10-01 22:28:56,479 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 88 [2019-10-01 22:28:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:56,479 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2019-10-01 22:28:56,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:28:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2019-10-01 22:28:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-01 22:28:56,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:56,481 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:56,481 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -392538603, now seen corresponding path program 21 times [2019-10-01 22:28:56,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:56,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:56,758 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:56,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:28:56,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:56,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:28:57,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:57,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2019-10-01 22:28:57,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:28:57,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:28:57,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:28:57,079 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 35 states. [2019-10-01 22:28:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:57,325 INFO L93 Difference]: Finished difference Result 214 states and 268 transitions. [2019-10-01 22:28:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:28:57,325 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2019-10-01 22:28:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:57,326 INFO L225 Difference]: With dead ends: 214 [2019-10-01 22:28:57,326 INFO L226 Difference]: Without dead ends: 138 [2019-10-01 22:28:57,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:28:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-01 22:28:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2019-10-01 22:28:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 22:28:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2019-10-01 22:28:57,332 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 90 [2019-10-01 22:28:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:57,333 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2019-10-01 22:28:57,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:28:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2019-10-01 22:28:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:28:57,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:57,334 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:57,334 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1768371632, now seen corresponding path program 22 times [2019-10-01 22:28:57,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:57,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:57,617 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:57,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:57,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:57,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:28:57,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:57,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:28:57,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:28:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:28:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:57,732 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 26 states. [2019-10-01 22:28:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:57,810 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2019-10-01 22:28:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:28:57,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2019-10-01 22:28:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:57,812 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:28:57,812 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 22:28:57,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 22:28:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-10-01 22:28:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:28:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2019-10-01 22:28:57,818 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 95 [2019-10-01 22:28:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:57,818 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2019-10-01 22:28:57,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:28:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2019-10-01 22:28:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:28:57,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:57,820 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:57,820 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -742920114, now seen corresponding path program 23 times [2019-10-01 22:28:57,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:58,137 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:58,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:58,501 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:28:58,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:58,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:28:58,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:28:58,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:58,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14] total 38 [2019-10-01 22:28:58,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:28:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:28:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:58,718 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 38 states. [2019-10-01 22:28:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:58,895 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2019-10-01 22:28:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:28:58,898 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 97 [2019-10-01 22:28:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:58,899 INFO L225 Difference]: With dead ends: 230 [2019-10-01 22:28:58,899 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:28:58,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:28:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-10-01 22:28:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:28:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2019-10-01 22:28:58,907 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 97 [2019-10-01 22:28:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:58,907 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2019-10-01 22:28:58,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:28:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2019-10-01 22:28:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 22:28:58,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:58,909 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:58,909 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1743015205, now seen corresponding path program 24 times [2019-10-01 22:28:58,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:58,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:58,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:59,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:59,249 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:00,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:29:00,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:00,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:29:00,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:00,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:00,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:29:00,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:29:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:29:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:00,371 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand 28 states. [2019-10-01 22:29:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:00,446 INFO L93 Difference]: Finished difference Result 234 states and 290 transitions. [2019-10-01 22:29:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:29:00,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2019-10-01 22:29:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:00,448 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:29:00,448 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:29:00,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:29:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 22:29:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:29:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2019-10-01 22:29:00,454 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 102 [2019-10-01 22:29:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:00,455 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2019-10-01 22:29:00,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:29:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2019-10-01 22:29:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 22:29:00,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:00,456 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:00,456 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:00,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1419810179, now seen corresponding path program 25 times [2019-10-01 22:29:00,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:00,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:00,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:00,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:00,854 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:00,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:29:00,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:00,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:00,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:29:00,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:29:00,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:29:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:29:00,975 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand 29 states. [2019-10-01 22:29:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:01,048 INFO L93 Difference]: Finished difference Result 236 states and 292 transitions. [2019-10-01 22:29:01,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:29:01,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2019-10-01 22:29:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:01,050 INFO L225 Difference]: With dead ends: 236 [2019-10-01 22:29:01,050 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:29:01,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:29:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:29:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:29:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:29:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2019-10-01 22:29:01,058 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 104 [2019-10-01 22:29:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2019-10-01 22:29:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:29:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2019-10-01 22:29:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 22:29:01,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:01,059 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:01,060 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -57425505, now seen corresponding path program 26 times [2019-10-01 22:29:01,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:01,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:01,430 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:01,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:01,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:01,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:29:01,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:01,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:01,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:29:01,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:29:01,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:29:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:29:01,550 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 30 states. [2019-10-01 22:29:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:01,706 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2019-10-01 22:29:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:29:01,706 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 106 [2019-10-01 22:29:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:01,708 INFO L225 Difference]: With dead ends: 238 [2019-10-01 22:29:01,708 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 22:29:01,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:29:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 22:29:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 22:29:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 22:29:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2019-10-01 22:29:01,715 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 106 [2019-10-01 22:29:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:01,716 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2019-10-01 22:29:01,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:29:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2019-10-01 22:29:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:29:01,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:01,717 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:01,718 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash -770779071, now seen corresponding path program 27 times [2019-10-01 22:29:01,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:01,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:29:02,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:02,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:02,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:02,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:29:02,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:02,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:29:02,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15] total 43 [2019-10-01 22:29:02,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:29:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:29:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:29:02,719 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand 43 states. [2019-10-01 22:29:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:02,957 INFO L93 Difference]: Finished difference Result 250 states and 312 transitions. [2019-10-01 22:29:02,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:29:02,957 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 108 [2019-10-01 22:29:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:02,959 INFO L225 Difference]: With dead ends: 250 [2019-10-01 22:29:02,959 INFO L226 Difference]: Without dead ends: 162 [2019-10-01 22:29:02,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:29:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-01 22:29:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2019-10-01 22:29:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 22:29:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2019-10-01 22:29:02,965 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 108 [2019-10-01 22:29:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:02,965 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2019-10-01 22:29:02,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:29:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2019-10-01 22:29:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 22:29:02,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:02,966 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:02,967 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1597532292, now seen corresponding path program 28 times [2019-10-01 22:29:02,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:02,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:29:03,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:03,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:03,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:03,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:03,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:29:03,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:29:03,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:03,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 22:29:03,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:29:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:29:03,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:29:03,691 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 32 states. [2019-10-01 22:29:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:03,841 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2019-10-01 22:29:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:29:03,842 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2019-10-01 22:29:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:03,844 INFO L225 Difference]: With dead ends: 254 [2019-10-01 22:29:03,844 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 22:29:03,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:29:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 22:29:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-10-01 22:29:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 22:29:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2019-10-01 22:29:03,852 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 113 [2019-10-01 22:29:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:03,852 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2019-10-01 22:29:03,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:29:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2019-10-01 22:29:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 22:29:03,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:03,854 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:03,854 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1883834462, now seen corresponding path program 29 times [2019-10-01 22:29:03,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:03,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:29:04,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:04,571 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:05,202 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:29:05,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:05,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:29:05,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:05,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16] total 46 [2019-10-01 22:29:05,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:29:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:29:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:29:05,558 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 46 states. [2019-10-01 22:29:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:05,739 INFO L93 Difference]: Finished difference Result 266 states and 332 transitions. [2019-10-01 22:29:05,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:29:05,740 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 115 [2019-10-01 22:29:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:05,741 INFO L225 Difference]: With dead ends: 266 [2019-10-01 22:29:05,741 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:29:05,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:29:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:29:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2019-10-01 22:29:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 22:29:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2019-10-01 22:29:05,748 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 115 [2019-10-01 22:29:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:05,748 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2019-10-01 22:29:05,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:29:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2019-10-01 22:29:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 22:29:05,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:05,749 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:05,750 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1764460921, now seen corresponding path program 30 times [2019-10-01 22:29:05,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:05,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:06,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:06,189 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:09,531 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 22:29:09,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:09,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:29:09,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:29:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:29:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:29:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:09,576 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand 34 states. [2019-10-01 22:29:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:09,665 INFO L93 Difference]: Finished difference Result 270 states and 334 transitions. [2019-10-01 22:29:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:29:09,666 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 120 [2019-10-01 22:29:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:09,667 INFO L225 Difference]: With dead ends: 270 [2019-10-01 22:29:09,667 INFO L226 Difference]: Without dead ends: 170 [2019-10-01 22:29:09,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-01 22:29:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-10-01 22:29:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 22:29:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2019-10-01 22:29:09,674 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 120 [2019-10-01 22:29:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:09,674 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2019-10-01 22:29:09,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:29:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2019-10-01 22:29:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:29:09,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:09,676 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:09,676 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1896499625, now seen corresponding path program 31 times [2019-10-01 22:29:09,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:09,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:10,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:10,169 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:29:10,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:10,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:10,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:29:10,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:29:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:29:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:10,296 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand 35 states. [2019-10-01 22:29:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:10,425 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2019-10-01 22:29:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:29:10,426 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-10-01 22:29:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:10,427 INFO L225 Difference]: With dead ends: 272 [2019-10-01 22:29:10,427 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:29:10,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:29:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 22:29:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:29:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2019-10-01 22:29:10,434 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 122 [2019-10-01 22:29:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:10,434 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2019-10-01 22:29:10,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:29:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2019-10-01 22:29:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:29:10,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:10,436 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:10,436 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1793598389, now seen corresponding path program 32 times [2019-10-01 22:29:10,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:10,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:10,958 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:11,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:11,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:11,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:11,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:29:11,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:11,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:11,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:29:11,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:29:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:29:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:11,134 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand 36 states. [2019-10-01 22:29:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:11,252 INFO L93 Difference]: Finished difference Result 274 states and 338 transitions. [2019-10-01 22:29:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:29:11,253 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 124 [2019-10-01 22:29:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:11,254 INFO L225 Difference]: With dead ends: 274 [2019-10-01 22:29:11,254 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 22:29:11,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 22:29:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 22:29:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:29:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-01 22:29:11,261 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 124 [2019-10-01 22:29:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:11,261 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-01 22:29:11,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:29:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-01 22:29:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:29:11,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:11,263 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:11,263 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash -334803347, now seen corresponding path program 33 times [2019-10-01 22:29:11,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:11,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:11,913 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:11,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:12,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:29:12,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:29:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-10-01 22:29:12,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 17] total 51 [2019-10-01 22:29:12,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:29:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:29:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:29:12,512 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand 51 states. [2019-10-01 22:29:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:12,853 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2019-10-01 22:29:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:29:12,854 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 126 [2019-10-01 22:29:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:12,855 INFO L225 Difference]: With dead ends: 286 [2019-10-01 22:29:12,855 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 22:29:12,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:29:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 22:29:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2019-10-01 22:29:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:29:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2019-10-01 22:29:12,863 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 126 [2019-10-01 22:29:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:12,865 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2019-10-01 22:29:12,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:29:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2019-10-01 22:29:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 22:29:12,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:12,867 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:12,867 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 912852824, now seen corresponding path program 34 times [2019-10-01 22:29:12,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:12,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:13,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:13,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:13,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:13,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:13,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:13,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:29:13,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:13,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:29:13,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:29:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:29:13,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:13,574 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand 38 states. [2019-10-01 22:29:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:13,695 INFO L93 Difference]: Finished difference Result 290 states and 358 transitions. [2019-10-01 22:29:13,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:29:13,697 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 131 [2019-10-01 22:29:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:13,698 INFO L225 Difference]: With dead ends: 290 [2019-10-01 22:29:13,698 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:29:13,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:29:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:29:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:29:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2019-10-01 22:29:13,705 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 131 [2019-10-01 22:29:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:13,705 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2019-10-01 22:29:13,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:29:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2019-10-01 22:29:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 22:29:13,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:13,706 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:13,707 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:13,707 INFO L82 PathProgramCache]: Analyzing trace with hash -906409226, now seen corresponding path program 35 times [2019-10-01 22:29:13,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:13,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:14,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:14,603 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:15,940 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:29:15,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:15,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:29:15,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-10-01 22:29:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 18] total 54 [2019-10-01 22:29:16,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:29:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:29:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=2007, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:29:16,284 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand 54 states. [2019-10-01 22:29:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:16,585 INFO L93 Difference]: Finished difference Result 302 states and 376 transitions. [2019-10-01 22:29:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:29:16,586 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 133 [2019-10-01 22:29:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:16,587 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:29:16,587 INFO L226 Difference]: Without dead ends: 196 [2019-10-01 22:29:16,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=855, Invalid=2007, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:29:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-01 22:29:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2019-10-01 22:29:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 22:29:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2019-10-01 22:29:16,593 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 133 [2019-10-01 22:29:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:16,594 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2019-10-01 22:29:16,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:29:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2019-10-01 22:29:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-01 22:29:16,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:16,595 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:16,595 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 629050931, now seen corresponding path program 36 times [2019-10-01 22:29:16,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:16,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:16,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:16,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-10-01 22:29:17,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:17,299 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:37,292 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:29:37,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:37,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:29:37,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-10-01 22:29:37,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:37,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 19] total 56 [2019-10-01 22:29:37,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:29:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:29:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:37,681 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand 56 states. [2019-10-01 22:29:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,984 INFO L93 Difference]: Finished difference Result 316 states and 394 transitions. [2019-10-01 22:29:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:29:37,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 138 [2019-10-01 22:29:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,985 INFO L225 Difference]: With dead ends: 316 [2019-10-01 22:29:37,985 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:29:37,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:29:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-10-01 22:29:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:29:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2019-10-01 22:29:37,992 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 138 [2019-10-01 22:29:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,992 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2019-10-01 22:29:37,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:29:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2019-10-01 22:29:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:29:37,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,994 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,994 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 355052754, now seen corresponding path program 37 times [2019-10-01 22:29:37,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:38,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,626 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:38,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:29:38,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:38,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:29:38,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:29:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:29:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:29:38,791 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand 41 states. [2019-10-01 22:29:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:38,922 INFO L93 Difference]: Finished difference Result 320 states and 396 transitions. [2019-10-01 22:29:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:29:38,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-10-01 22:29:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:38,923 INFO L225 Difference]: With dead ends: 320 [2019-10-01 22:29:38,923 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:29:38,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:29:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:29:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:29:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:29:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 239 transitions. [2019-10-01 22:29:38,929 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 239 transitions. Word has length 143 [2019-10-01 22:29:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:38,930 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 239 transitions. [2019-10-01 22:29:38,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:29:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 239 transitions. [2019-10-01 22:29:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 22:29:38,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:38,931 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:38,931 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1347122032, now seen corresponding path program 38 times [2019-10-01 22:29:38,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:38,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:39,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:39,554 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:39,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:39,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:39,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:39,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:29:39,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:39,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:39,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:29:39,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:29:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:29:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:29:39,708 INFO L87 Difference]: Start difference. First operand 201 states and 239 transitions. Second operand 42 states. [2019-10-01 22:29:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:39,876 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-10-01 22:29:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:29:39,879 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 145 [2019-10-01 22:29:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:39,880 INFO L225 Difference]: With dead ends: 322 [2019-10-01 22:29:39,880 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:29:39,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:29:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:29:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 22:29:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:29:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2019-10-01 22:29:39,887 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 145 [2019-10-01 22:29:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:39,887 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2019-10-01 22:29:39,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:29:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2019-10-01 22:29:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 22:29:39,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:39,889 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:39,889 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1242958478, now seen corresponding path program 39 times [2019-10-01 22:29:39,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:40,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,567 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:41,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:29:41,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:41,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:29:41,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:29:41,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:41,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 20] total 60 [2019-10-01 22:29:41,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:29:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:29:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2490, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:29:41,776 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand 60 states. [2019-10-01 22:29:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:42,109 INFO L93 Difference]: Finished difference Result 334 states and 416 transitions. [2019-10-01 22:29:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:29:42,109 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2019-10-01 22:29:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:42,111 INFO L225 Difference]: With dead ends: 334 [2019-10-01 22:29:42,111 INFO L226 Difference]: Without dead ends: 216 [2019-10-01 22:29:42,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1050, Invalid=2490, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:29:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-01 22:29:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2019-10-01 22:29:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 22:29:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2019-10-01 22:29:42,117 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 147 [2019-10-01 22:29:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:42,118 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2019-10-01 22:29:42,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:29:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2019-10-01 22:29:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:29:42,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:42,119 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:42,119 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1582799845, now seen corresponding path program 40 times [2019-10-01 22:29:42,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2019-10-01 22:29:42,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:42,907 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:42,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:43,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:43,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:43,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:29:43,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-10-01 22:29:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:43,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 21] total 62 [2019-10-01 22:29:43,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:29:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:29:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=2670, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:29:43,514 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 62 states. [2019-10-01 22:29:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:43,858 INFO L93 Difference]: Finished difference Result 348 states and 434 transitions. [2019-10-01 22:29:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:29:43,858 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2019-10-01 22:29:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:43,860 INFO L225 Difference]: With dead ends: 348 [2019-10-01 22:29:43,860 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:29:43,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1112, Invalid=2670, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:29:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:29:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-10-01 22:29:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 22:29:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 261 transitions. [2019-10-01 22:29:43,867 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 261 transitions. Word has length 152 [2019-10-01 22:29:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:43,867 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 261 transitions. [2019-10-01 22:29:43,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:29:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2019-10-01 22:29:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 22:29:43,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:43,868 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:43,869 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 463806826, now seen corresponding path program 41 times [2019-10-01 22:29:43,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-10-01 22:29:44,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:44,603 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:44,666 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:53,162 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:29:53,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:29:53,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 22:29:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:53,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 22] total 64 [2019-10-01 22:29:53,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:29:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:29:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:29:53,698 INFO L87 Difference]: Start difference. First operand 219 states and 261 transitions. Second operand 64 states. [2019-10-01 22:29:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:54,070 INFO L93 Difference]: Finished difference Result 362 states and 452 transitions. [2019-10-01 22:29:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:29:54,071 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 157 [2019-10-01 22:29:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:54,072 INFO L225 Difference]: With dead ends: 362 [2019-10-01 22:29:54,072 INFO L226 Difference]: Without dead ends: 232 [2019-10-01 22:29:54,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:29:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-01 22:29:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2019-10-01 22:29:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 22:29:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2019-10-01 22:29:54,082 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 157 [2019-10-01 22:29:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:54,082 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2019-10-01 22:29:54,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:29:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2019-10-01 22:29:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 22:29:54,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:54,084 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:54,084 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 983362879, now seen corresponding path program 42 times [2019-10-01 22:29:54,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:54,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:54,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-10-01 22:29:55,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:55,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:09,596 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-01 22:30:09,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:09,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:30:09,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1 proven. 590 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-10-01 22:30:10,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 23] total 66 [2019-10-01 22:30:10,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:30:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:30:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:30:10,324 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand 66 states. [2019-10-01 22:30:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:10,711 INFO L93 Difference]: Finished difference Result 376 states and 470 transitions. [2019-10-01 22:30:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:30:10,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 162 [2019-10-01 22:30:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:10,713 INFO L225 Difference]: With dead ends: 376 [2019-10-01 22:30:10,713 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 22:30:10,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:30:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 22:30:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 235. [2019-10-01 22:30:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-01 22:30:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2019-10-01 22:30:10,720 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 162 [2019-10-01 22:30:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:10,721 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2019-10-01 22:30:10,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:30:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2019-10-01 22:30:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 22:30:10,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:10,722 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:10,723 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1921476678, now seen corresponding path program 43 times [2019-10-01 22:30:10,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:10,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:11,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:11,534 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:11,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:30:11,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:11,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:11,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:30:11,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:30:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:30:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:30:11,745 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand 47 states. [2019-10-01 22:30:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:11,930 INFO L93 Difference]: Finished difference Result 380 states and 472 transitions. [2019-10-01 22:30:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:30:11,931 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 167 [2019-10-01 22:30:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:11,932 INFO L225 Difference]: With dead ends: 380 [2019-10-01 22:30:11,932 INFO L226 Difference]: Without dead ends: 238 [2019-10-01 22:30:11,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:30:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-01 22:30:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-10-01 22:30:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-01 22:30:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2019-10-01 22:30:11,939 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 167 [2019-10-01 22:30:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:11,939 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2019-10-01 22:30:11,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:30:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2019-10-01 22:30:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-01 22:30:11,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:11,941 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:11,941 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1945717532, now seen corresponding path program 44 times [2019-10-01 22:30:11,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:11,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:12,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:12,766 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:12,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:12,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:30:12,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:12,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:12,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:30:12,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:30:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:30:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:12,976 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand 48 states. [2019-10-01 22:30:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:13,129 INFO L93 Difference]: Finished difference Result 382 states and 474 transitions. [2019-10-01 22:30:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:30:13,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 169 [2019-10-01 22:30:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:13,130 INFO L225 Difference]: With dead ends: 382 [2019-10-01 22:30:13,130 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 22:30:13,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 22:30:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-01 22:30:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-01 22:30:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 285 transitions. [2019-10-01 22:30:13,138 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 285 transitions. Word has length 169 [2019-10-01 22:30:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:13,139 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 285 transitions. [2019-10-01 22:30:13,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:30:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 285 transitions. [2019-10-01 22:30:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 22:30:13,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:13,140 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:13,140 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1122324994, now seen corresponding path program 45 times [2019-10-01 22:30:13,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:13,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:14,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:14,285 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:14,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:30:15,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-10-01 22:30:15,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:15,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:30:15,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1 proven. 651 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-10-01 22:30:16,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:16,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 24] total 70 [2019-10-01 22:30:16,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:30:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:30:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=3427, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:30:16,514 INFO L87 Difference]: Start difference. First operand 239 states and 285 transitions. Second operand 70 states. [2019-10-01 22:30:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:17,021 INFO L93 Difference]: Finished difference Result 394 states and 492 transitions. [2019-10-01 22:30:17,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:30:17,023 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 171 [2019-10-01 22:30:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:17,025 INFO L225 Difference]: With dead ends: 394 [2019-10-01 22:30:17,026 INFO L226 Difference]: Without dead ends: 252 [2019-10-01 22:30:17,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1403, Invalid=3427, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:30:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-01 22:30:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2019-10-01 22:30:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-01 22:30:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2019-10-01 22:30:17,040 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 171 [2019-10-01 22:30:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:17,040 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2019-10-01 22:30:17,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:30:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2019-10-01 22:30:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:30:17,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:17,048 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:17,048 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1869885991, now seen corresponding path program 46 times [2019-10-01 22:30:17,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:17,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 22:30:18,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:18,355 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:18,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:18,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:18,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:18,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:30:18,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:30:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:18,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 22:30:18,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:30:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:30:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:30:18,587 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand 50 states. [2019-10-01 22:30:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:18,802 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2019-10-01 22:30:18,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:30:18,803 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 176 [2019-10-01 22:30:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:18,804 INFO L225 Difference]: With dead ends: 398 [2019-10-01 22:30:18,805 INFO L226 Difference]: Without dead ends: 250 [2019-10-01 22:30:18,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:30:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-01 22:30:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-10-01 22:30:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-01 22:30:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 297 transitions. [2019-10-01 22:30:18,812 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 297 transitions. Word has length 176 [2019-10-01 22:30:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:18,812 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 297 transitions. [2019-10-01 22:30:18,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:30:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 297 transitions. [2019-10-01 22:30:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 22:30:18,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:18,814 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:18,815 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 666777417, now seen corresponding path program 47 times [2019-10-01 22:30:18,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:18,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:18,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 22:30:19,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:19,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:19,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:23,619 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 22:30:23,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:23,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:30:23,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-10-01 22:30:24,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:24,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25] total 73 [2019-10-01 22:30:24,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:30:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:30:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=3732, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:30:24,531 INFO L87 Difference]: Start difference. First operand 249 states and 297 transitions. Second operand 73 states. [2019-10-01 22:30:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:24,960 INFO L93 Difference]: Finished difference Result 410 states and 512 transitions. [2019-10-01 22:30:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:30:24,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 178 [2019-10-01 22:30:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:24,966 INFO L225 Difference]: With dead ends: 410 [2019-10-01 22:30:24,966 INFO L226 Difference]: Without dead ends: 262 [2019-10-01 22:30:24,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1524, Invalid=3732, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:30:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-01 22:30:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2019-10-01 22:30:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-01 22:30:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2019-10-01 22:30:24,973 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 178 [2019-10-01 22:30:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:24,973 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2019-10-01 22:30:24,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:30:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2019-10-01 22:30:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-01 22:30:24,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:24,975 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:24,975 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1277062652, now seen corresponding path program 48 times [2019-10-01 22:30:24,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:24,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3087 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 22:30:26,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:26,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:26,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:53,905 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-01 22:30:53,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:53,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:30:53,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3087 backedges. 1 proven. 782 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:54,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 26] total 75 [2019-10-01 22:30:54,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 22:30:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 22:30:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=3951, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:30:54,612 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand 75 states. [2019-10-01 22:30:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:55,046 INFO L93 Difference]: Finished difference Result 424 states and 530 transitions. [2019-10-01 22:30:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 22:30:55,046 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2019-10-01 22:30:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:55,047 INFO L225 Difference]: With dead ends: 424 [2019-10-01 22:30:55,047 INFO L226 Difference]: Without dead ends: 270 [2019-10-01 22:30:55,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1599, Invalid=3951, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:30:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-01 22:30:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2019-10-01 22:30:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-01 22:30:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2019-10-01 22:30:55,055 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 183 [2019-10-01 22:30:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:55,055 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2019-10-01 22:30:55,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 22:30:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2019-10-01 22:30:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-01 22:30:55,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:55,057 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:55,057 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1577941229, now seen corresponding path program 49 times [2019-10-01 22:30:55,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:55,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:55,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:30:56,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:56,234 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:56,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:30:56,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:30:56,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 22:30:56,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:30:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:30:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:30:56,456 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand 53 states. [2019-10-01 22:30:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:56,658 INFO L93 Difference]: Finished difference Result 428 states and 532 transitions. [2019-10-01 22:30:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:30:56,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 188 [2019-10-01 22:30:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:56,660 INFO L225 Difference]: With dead ends: 428 [2019-10-01 22:30:56,661 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 22:30:56,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:30:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 22:30:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-10-01 22:30:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-01 22:30:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 319 transitions. [2019-10-01 22:30:56,667 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 319 transitions. Word has length 188 [2019-10-01 22:30:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:56,668 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 319 transitions. [2019-10-01 22:30:56,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:30:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 319 transitions. [2019-10-01 22:30:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 22:30:56,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:56,669 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:56,670 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 870243087, now seen corresponding path program 50 times [2019-10-01 22:30:56,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:56,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3353 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:30:57,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:57,758 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:57,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:57,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:57,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:30:57,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3353 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:58,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:30:58,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:30:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:30:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:30:58,014 INFO L87 Difference]: Start difference. First operand 267 states and 319 transitions. Second operand 54 states. [2019-10-01 22:30:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:58,203 INFO L93 Difference]: Finished difference Result 430 states and 534 transitions. [2019-10-01 22:30:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:30:58,203 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 190 [2019-10-01 22:30:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:58,204 INFO L225 Difference]: With dead ends: 430 [2019-10-01 22:30:58,205 INFO L226 Difference]: Without dead ends: 270 [2019-10-01 22:30:58,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:30:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-01 22:30:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-10-01 22:30:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-01 22:30:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 321 transitions. [2019-10-01 22:30:58,215 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 321 transitions. Word has length 190 [2019-10-01 22:30:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:58,216 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 321 transitions. [2019-10-01 22:30:58,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:30:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 321 transitions. [2019-10-01 22:30:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:30:58,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:58,218 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:58,218 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -622838607, now seen corresponding path program 51 times [2019-10-01 22:30:58,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:58,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:30:59,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:59,341 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:59,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:01,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-10-01 22:31:01,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:01,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:31:01,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 1 proven. 852 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-01 22:31:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 27] total 79 [2019-10-01 22:31:02,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 22:31:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 22:31:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1781, Invalid=4381, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:31:02,580 INFO L87 Difference]: Start difference. First operand 269 states and 321 transitions. Second operand 79 states. [2019-10-01 22:31:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:03,030 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2019-10-01 22:31:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 22:31:03,031 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 192 [2019-10-01 22:31:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:03,032 INFO L225 Difference]: With dead ends: 442 [2019-10-01 22:31:03,032 INFO L226 Difference]: Without dead ends: 282 [2019-10-01 22:31:03,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1781, Invalid=4381, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:31:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-01 22:31:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2019-10-01 22:31:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-01 22:31:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2019-10-01 22:31:03,038 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 192 [2019-10-01 22:31:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:03,038 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2019-10-01 22:31:03,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 22:31:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2019-10-01 22:31:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-01 22:31:03,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:03,040 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:03,040 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1272970476, now seen corresponding path program 52 times [2019-10-01 22:31:03,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:03,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:04,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:04,139 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:04,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:04,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:04,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 22:31:04,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:04,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:04,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 22:31:04,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:31:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:31:04,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:04,404 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand 56 states. [2019-10-01 22:31:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:04,619 INFO L93 Difference]: Finished difference Result 446 states and 554 transitions. [2019-10-01 22:31:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:31:04,619 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 197 [2019-10-01 22:31:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:04,621 INFO L225 Difference]: With dead ends: 446 [2019-10-01 22:31:04,621 INFO L226 Difference]: Without dead ends: 280 [2019-10-01 22:31:04,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-01 22:31:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-10-01 22:31:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-01 22:31:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 333 transitions. [2019-10-01 22:31:04,629 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 333 transitions. Word has length 197 [2019-10-01 22:31:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:04,629 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 333 transitions. [2019-10-01 22:31:04,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:31:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 333 transitions. [2019-10-01 22:31:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-01 22:31:04,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:04,631 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:04,631 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1753081650, now seen corresponding path program 53 times [2019-10-01 22:31:04,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:04,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:04,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:05,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:05,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:05,861 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:31:27,117 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 22:31:27,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:27,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:31:27,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 1 proven. 925 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-10-01 22:31:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 28] total 82 [2019-10-01 22:31:28,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:31:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:31:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1917, Invalid=4725, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:31:28,136 INFO L87 Difference]: Start difference. First operand 279 states and 333 transitions. Second operand 82 states. [2019-10-01 22:31:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:28,658 INFO L93 Difference]: Finished difference Result 458 states and 572 transitions. [2019-10-01 22:31:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:31:28,659 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 199 [2019-10-01 22:31:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:28,661 INFO L225 Difference]: With dead ends: 458 [2019-10-01 22:31:28,661 INFO L226 Difference]: Without dead ends: 292 [2019-10-01 22:31:28,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1917, Invalid=4725, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:31:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-01 22:31:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2019-10-01 22:31:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-01 22:31:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 343 transitions. [2019-10-01 22:31:28,670 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 343 transitions. Word has length 199 [2019-10-01 22:31:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:28,671 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 343 transitions. [2019-10-01 22:31:28,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:31:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 343 transitions. [2019-10-01 22:31:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:31:28,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:28,673 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:28,673 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1218602999, now seen corresponding path program 54 times [2019-10-01 22:31:28,674 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:31:30,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:30,243 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:30,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:33:28,999 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-10-01 22:33:28,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:29,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:33:29,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:29,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-01 22:33:29,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:33:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:33:29,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:33:29,089 INFO L87 Difference]: Start difference. First operand 287 states and 343 transitions. Second operand 58 states. [2019-10-01 22:33:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:29,254 INFO L93 Difference]: Finished difference Result 462 states and 574 transitions. [2019-10-01 22:33:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:33:29,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 204 [2019-10-01 22:33:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:29,256 INFO L225 Difference]: With dead ends: 462 [2019-10-01 22:33:29,256 INFO L226 Difference]: Without dead ends: 290 [2019-10-01 22:33:29,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:33:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-01 22:33:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-10-01 22:33:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-01 22:33:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 345 transitions. [2019-10-01 22:33:29,262 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 345 transitions. Word has length 204 [2019-10-01 22:33:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:29,263 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 345 transitions. [2019-10-01 22:33:29,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:33:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 345 transitions. [2019-10-01 22:33:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 22:33:29,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:29,265 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:29,265 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 436160025, now seen corresponding path program 55 times [2019-10-01 22:33:29,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:29,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:29,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4027 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:30,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:30,522 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:30,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:33:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4027 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 22:33:30,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:33:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:33:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:33:30,772 INFO L87 Difference]: Start difference. First operand 289 states and 345 transitions. Second operand 59 states. [2019-10-01 22:33:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:31,014 INFO L93 Difference]: Finished difference Result 464 states and 576 transitions. [2019-10-01 22:33:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:33:31,014 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 206 [2019-10-01 22:33:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:31,016 INFO L225 Difference]: With dead ends: 464 [2019-10-01 22:33:31,016 INFO L226 Difference]: Without dead ends: 292 [2019-10-01 22:33:31,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:33:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-01 22:33:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-10-01 22:33:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-01 22:33:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 347 transitions. [2019-10-01 22:33:31,022 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 347 transitions. Word has length 206 [2019-10-01 22:33:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:31,022 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 347 transitions. [2019-10-01 22:33:31,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:33:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 347 transitions. [2019-10-01 22:33:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 22:33:31,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:31,024 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:31,024 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash 127738811, now seen corresponding path program 56 times [2019-10-01 22:33:31,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:31,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:31,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:31,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:32,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:32,517 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:33:32,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:33:32,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:32,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:33:32,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:32,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 22:33:32,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:33:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:33:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:33:32,766 INFO L87 Difference]: Start difference. First operand 291 states and 347 transitions. Second operand 60 states. [2019-10-01 22:33:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:33,028 INFO L93 Difference]: Finished difference Result 466 states and 578 transitions. [2019-10-01 22:33:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:33:33,028 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 208 [2019-10-01 22:33:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:33,030 INFO L225 Difference]: With dead ends: 466 [2019-10-01 22:33:33,030 INFO L226 Difference]: Without dead ends: 294 [2019-10-01 22:33:33,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:33:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-01 22:33:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-10-01 22:33:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-01 22:33:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 349 transitions. [2019-10-01 22:33:33,036 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 349 transitions. Word has length 208 [2019-10-01 22:33:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:33,037 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 349 transitions. [2019-10-01 22:33:33,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:33:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 349 transitions. [2019-10-01 22:33:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 22:33:33,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:33,038 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:33,039 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:33,039 INFO L82 PathProgramCache]: Analyzing trace with hash 87695581, now seen corresponding path program 57 times [2019-10-01 22:33:33,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:33,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:33,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:33,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:33:34,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:34,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:33:38,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-01 22:33:38,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:38,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:33:38,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 1 proven. 1001 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-10-01 22:33:39,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:39,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 29] total 87 [2019-10-01 22:33:39,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-01 22:33:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-01 22:33:39,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2175, Invalid=5307, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:33:39,624 INFO L87 Difference]: Start difference. First operand 293 states and 349 transitions. Second operand 87 states. [2019-10-01 22:33:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:40,137 INFO L93 Difference]: Finished difference Result 478 states and 596 transitions. [2019-10-01 22:33:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-01 22:33:40,137 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 210 [2019-10-01 22:33:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:40,138 INFO L225 Difference]: With dead ends: 478 [2019-10-01 22:33:40,138 INFO L226 Difference]: Without dead ends: 306 [2019-10-01 22:33:40,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2175, Invalid=5307, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:33:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-01 22:33:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2019-10-01 22:33:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-01 22:33:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 359 transitions. [2019-10-01 22:33:40,147 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 359 transitions. Word has length 210 [2019-10-01 22:33:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:40,147 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 359 transitions. [2019-10-01 22:33:40,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-01 22:33:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 359 transitions. [2019-10-01 22:33:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-01 22:33:40,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:40,149 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:40,149 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 314127336, now seen corresponding path program 58 times [2019-10-01 22:33:40,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:40,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:33:41,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:41,575 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:33:41,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:33:41,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:41,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:33:41,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:33:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 22:33:41,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:33:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:33:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:33:41,858 INFO L87 Difference]: Start difference. First operand 301 states and 359 transitions. Second operand 62 states. [2019-10-01 22:33:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:42,110 INFO L93 Difference]: Finished difference Result 482 states and 598 transitions. [2019-10-01 22:33:42,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:33:42,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 215 [2019-10-01 22:33:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:42,111 INFO L225 Difference]: With dead ends: 482 [2019-10-01 22:33:42,111 INFO L226 Difference]: Without dead ends: 304 [2019-10-01 22:33:42,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:33:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-01 22:33:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-10-01 22:33:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-01 22:33:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2019-10-01 22:33:42,118 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 215 [2019-10-01 22:33:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:42,118 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2019-10-01 22:33:42,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:33:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2019-10-01 22:33:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-01 22:33:42,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:42,120 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:42,121 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash 584944774, now seen corresponding path program 59 times [2019-10-01 22:33:42,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:42,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:42,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:33:43,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:43,537 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:34:10,785 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 22:34:10,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:10,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:34:10,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 1 proven. 1080 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-10-01 22:34:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:11,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 30] total 90 [2019-10-01 22:34:11,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 22:34:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 22:34:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2325, Invalid=5685, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:34:11,773 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand 90 states. [2019-10-01 22:34:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:12,331 INFO L93 Difference]: Finished difference Result 494 states and 616 transitions. [2019-10-01 22:34:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-01 22:34:12,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 217 [2019-10-01 22:34:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:12,333 INFO L225 Difference]: With dead ends: 494 [2019-10-01 22:34:12,333 INFO L226 Difference]: Without dead ends: 316 [2019-10-01 22:34:12,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2325, Invalid=5685, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:34:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-10-01 22:34:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2019-10-01 22:34:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-01 22:34:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 371 transitions. [2019-10-01 22:34:12,341 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 371 transitions. Word has length 217 [2019-10-01 22:34:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:12,341 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 371 transitions. [2019-10-01 22:34:12,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 22:34:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 371 transitions. [2019-10-01 22:34:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:34:12,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:12,343 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:12,344 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1516687965, now seen corresponding path program 60 times [2019-10-01 22:34:12,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:12,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:12,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:12,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:12,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4763 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2019-10-01 22:34:13,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:13,825 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:13,955 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:36:02,351 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2019-10-01 22:36:02,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:02,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:36:02,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4763 backedges. 1 proven. 1162 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-10-01 22:36:03,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:03,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 31] total 92 [2019-10-01 22:36:03,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-01 22:36:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-01 22:36:03,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=5955, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:36:03,389 INFO L87 Difference]: Start difference. First operand 311 states and 371 transitions. Second operand 92 states. [2019-10-01 22:36:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:03,781 INFO L93 Difference]: Finished difference Result 508 states and 634 transitions. [2019-10-01 22:36:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-01 22:36:03,782 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 222 [2019-10-01 22:36:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:03,784 INFO L225 Difference]: With dead ends: 508 [2019-10-01 22:36:03,784 INFO L226 Difference]: Without dead ends: 324 [2019-10-01 22:36:03,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2417, Invalid=5955, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:36:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-01 22:36:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2019-10-01 22:36:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-01 22:36:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 381 transitions. [2019-10-01 22:36:03,791 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 381 transitions. Word has length 222 [2019-10-01 22:36:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:03,791 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 381 transitions. [2019-10-01 22:36:03,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-01 22:36:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 381 transitions. [2019-10-01 22:36:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 22:36:03,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:03,793 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:03,794 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1166503010, now seen corresponding path program 61 times [2019-10-01 22:36:03,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:03,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4969 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:36:05,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:05,294 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:36:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:05,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 22:36:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4969 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:36:05,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:05,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 22:36:05,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:36:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:36:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:36:05,589 INFO L87 Difference]: Start difference. First operand 319 states and 381 transitions. Second operand 65 states. [2019-10-01 22:36:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:05,781 INFO L93 Difference]: Finished difference Result 512 states and 636 transitions. [2019-10-01 22:36:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:36:05,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 227 [2019-10-01 22:36:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:05,783 INFO L225 Difference]: With dead ends: 512 [2019-10-01 22:36:05,783 INFO L226 Difference]: Without dead ends: 322 [2019-10-01 22:36:05,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:36:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-01 22:36:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-10-01 22:36:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-01 22:36:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 383 transitions. [2019-10-01 22:36:05,793 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 383 transitions. Word has length 227 [2019-10-01 22:36:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:05,793 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 383 transitions. [2019-10-01 22:36:05,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:36:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 383 transitions. [2019-10-01 22:36:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-01 22:36:05,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:05,795 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:05,796 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2126891008, now seen corresponding path program 62 times [2019-10-01 22:36:05,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:05,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:05,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:36:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5092 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:36:07,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:07,361 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:07,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:36:07,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:36:07,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:07,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 22:36:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5092 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:36:07,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 22:36:07,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:36:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:36:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:36:07,636 INFO L87 Difference]: Start difference. First operand 321 states and 383 transitions. Second operand 66 states. [2019-10-01 22:36:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:07,871 INFO L93 Difference]: Finished difference Result 514 states and 638 transitions. [2019-10-01 22:36:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:36:07,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 229 [2019-10-01 22:36:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:07,873 INFO L225 Difference]: With dead ends: 514 [2019-10-01 22:36:07,874 INFO L226 Difference]: Without dead ends: 324 [2019-10-01 22:36:07,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:36:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-01 22:36:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-10-01 22:36:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-01 22:36:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 385 transitions. [2019-10-01 22:36:07,881 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 385 transitions. Word has length 229 [2019-10-01 22:36:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:07,881 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 385 transitions. [2019-10-01 22:36:07,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:36:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 385 transitions. [2019-10-01 22:36:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-01 22:36:07,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:07,883 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:07,883 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1641788446, now seen corresponding path program 63 times [2019-10-01 22:36:07,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:07,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:07,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5217 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:36:09,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:09,480 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:09,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:36:16,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-10-01 22:36:16,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:16,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:36:16,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5217 backedges. 1 proven. 1247 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-10-01 22:36:17,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:17,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 32] total 96 [2019-10-01 22:36:17,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-01 22:36:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-01 22:36:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=6480, Unknown=0, NotChecked=0, Total=9120 [2019-10-01 22:36:17,246 INFO L87 Difference]: Start difference. First operand 323 states and 385 transitions. Second operand 96 states. [2019-10-01 22:36:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:17,698 INFO L93 Difference]: Finished difference Result 526 states and 656 transitions. [2019-10-01 22:36:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-01 22:36:17,698 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-10-01 22:36:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:17,700 INFO L225 Difference]: With dead ends: 526 [2019-10-01 22:36:17,700 INFO L226 Difference]: Without dead ends: 336 [2019-10-01 22:36:17,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2640, Invalid=6480, Unknown=0, NotChecked=0, Total=9120 [2019-10-01 22:36:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-01 22:36:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 331. [2019-10-01 22:36:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-10-01 22:36:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 395 transitions. [2019-10-01 22:36:17,707 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 395 transitions. Word has length 231 [2019-10-01 22:36:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:17,707 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 395 transitions. [2019-10-01 22:36:17,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-01 22:36:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 395 transitions. [2019-10-01 22:36:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:36:17,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:17,709 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:17,710 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1046043531, now seen corresponding path program 64 times [2019-10-01 22:36:17,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:17,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:17,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5432 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 22:36:19,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:19,378 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:19,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:36:19,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:36:19,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:19,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 22:36:19,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5432 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:36:19,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 22:36:19,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:36:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:36:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:36:19,694 INFO L87 Difference]: Start difference. First operand 331 states and 395 transitions. Second operand 68 states. [2019-10-01 22:36:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:19,949 INFO L93 Difference]: Finished difference Result 530 states and 658 transitions. [2019-10-01 22:36:19,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:36:19,954 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 236 [2019-10-01 22:36:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:19,956 INFO L225 Difference]: With dead ends: 530 [2019-10-01 22:36:19,956 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 22:36:19,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:36:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 22:36:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-10-01 22:36:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-10-01 22:36:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 397 transitions. [2019-10-01 22:36:19,963 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 397 transitions. Word has length 236 [2019-10-01 22:36:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:19,964 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 397 transitions. [2019-10-01 22:36:19,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:36:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 397 transitions. [2019-10-01 22:36:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:36:19,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:19,965 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:19,966 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1801793965, now seen corresponding path program 65 times [2019-10-01 22:36:19,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:19,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:19,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5561 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 22:36:21,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:21,614 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:37:31,102 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-10-01 22:37:31,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:31,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:37:31,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5561 backedges. 1 proven. 1335 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2019-10-01 22:37:32,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:32,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 33] total 99 [2019-10-01 22:37:32,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-01 22:37:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-01 22:37:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2805, Invalid=6897, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:37:32,334 INFO L87 Difference]: Start difference. First operand 333 states and 397 transitions. Second operand 99 states. [2019-10-01 22:37:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:32,902 INFO L93 Difference]: Finished difference Result 542 states and 676 transitions. [2019-10-01 22:37:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-01 22:37:32,902 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 238 [2019-10-01 22:37:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:32,904 INFO L225 Difference]: With dead ends: 542 [2019-10-01 22:37:32,904 INFO L226 Difference]: Without dead ends: 346 [2019-10-01 22:37:32,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2805, Invalid=6897, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:37:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-01 22:37:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 341. [2019-10-01 22:37:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-01 22:37:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 407 transitions. [2019-10-01 22:37:32,911 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 407 transitions. Word has length 238 [2019-10-01 22:37:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:32,911 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 407 transitions. [2019-10-01 22:37:32,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-01 22:37:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 407 transitions. [2019-10-01 22:37:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-01 22:37:32,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:32,913 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:32,913 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 289634328, now seen corresponding path program 66 times [2019-10-01 22:37:32,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:32,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:32,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5783 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-01 22:37:34,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:34,646 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:37:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:39:38,693 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2019-10-01 22:39:38,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:39:38,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5783 backedges. 1 proven. 1426 refuted. 0 times theorem prover too weak. 4356 trivial. 0 not checked. [2019-10-01 22:39:39,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:39,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 34] total 101 [2019-10-01 22:39:39,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-01 22:39:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-01 22:39:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2906, Invalid=7194, Unknown=0, NotChecked=0, Total=10100 [2019-10-01 22:39:39,960 INFO L87 Difference]: Start difference. First operand 341 states and 407 transitions. Second operand 101 states. [2019-10-01 22:39:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:39:40,505 INFO L93 Difference]: Finished difference Result 556 states and 694 transitions. [2019-10-01 22:39:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-01 22:39:40,506 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 243 [2019-10-01 22:39:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:39:40,507 INFO L225 Difference]: With dead ends: 556 [2019-10-01 22:39:40,507 INFO L226 Difference]: Without dead ends: 354 [2019-10-01 22:39:40,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2906, Invalid=7194, Unknown=0, NotChecked=0, Total=10100 [2019-10-01 22:39:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-01 22:39:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 349. [2019-10-01 22:39:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-01 22:39:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 417 transitions. [2019-10-01 22:39:40,514 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 417 transitions. Word has length 243 [2019-10-01 22:39:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:39:40,514 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 417 transitions. [2019-10-01 22:39:40,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-01 22:39:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 417 transitions. [2019-10-01 22:39:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 22:39:40,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:39:40,516 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:39:40,516 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:39:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:39:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1020361297, now seen corresponding path program 67 times [2019-10-01 22:39:40,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:39:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:39:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:40,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:39:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6010 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:39:42,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:39:42,264 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:39:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:39:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:42,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-01 22:39:42,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6010 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:39:42,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-10-01 22:39:42,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-01 22:39:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-01 22:39:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 22:39:42,606 INFO L87 Difference]: Start difference. First operand 349 states and 417 transitions. Second operand 71 states. [2019-10-01 22:39:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:39:42,823 INFO L93 Difference]: Finished difference Result 560 states and 696 transitions. [2019-10-01 22:39:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:39:42,824 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 248 [2019-10-01 22:39:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:39:42,825 INFO L225 Difference]: With dead ends: 560 [2019-10-01 22:39:42,825 INFO L226 Difference]: Without dead ends: 352 [2019-10-01 22:39:42,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 22:39:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-01 22:39:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-10-01 22:39:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-01 22:39:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 419 transitions. [2019-10-01 22:39:42,831 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 419 transitions. Word has length 248 [2019-10-01 22:39:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:39:42,831 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 419 transitions. [2019-10-01 22:39:42,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-01 22:39:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 419 transitions. [2019-10-01 22:39:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:39:42,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:39:42,833 INFO L411 BasicCegarLoop]: trace histogram [68, 68, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:39:42,834 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:39:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:39:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1714630003, now seen corresponding path program 68 times [2019-10-01 22:39:42,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:39:42,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:39:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:42,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:39:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6145 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:39:44,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:39:44,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:39:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:39:44,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:39:44,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:44,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-01 22:39:44,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6145 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:39:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 72 [2019-10-01 22:39:44,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 22:39:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 22:39:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 22:39:44,964 INFO L87 Difference]: Start difference. First operand 351 states and 419 transitions. Second operand 72 states. [2019-10-01 22:39:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:39:45,255 INFO L93 Difference]: Finished difference Result 562 states and 698 transitions. [2019-10-01 22:39:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 22:39:45,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 250 [2019-10-01 22:39:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:39:45,257 INFO L225 Difference]: With dead ends: 562 [2019-10-01 22:39:45,257 INFO L226 Difference]: Without dead ends: 354 [2019-10-01 22:39:45,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 22:39:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-01 22:39:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-10-01 22:39:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-01 22:39:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 421 transitions. [2019-10-01 22:39:45,263 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 421 transitions. Word has length 250 [2019-10-01 22:39:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:39:45,263 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 421 transitions. [2019-10-01 22:39:45,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 22:39:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 421 transitions. [2019-10-01 22:39:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:39:45,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:39:45,266 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:39:45,266 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:39:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:39:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1108041707, now seen corresponding path program 69 times [2019-10-01 22:39:45,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:39:45,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:39:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:45,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:39:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6282 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:39:47,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:39:47,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:39:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:39:58,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-10-01 22:39:58,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:58,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:39:58,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6282 backedges. 1 proven. 1520 refuted. 0 times theorem prover too weak. 4761 trivial. 0 not checked. [2019-10-01 22:39:59,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:59,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 35] total 105 [2019-10-01 22:39:59,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-01 22:39:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-01 22:39:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3150, Invalid=7770, Unknown=0, NotChecked=0, Total=10920 [2019-10-01 22:39:59,685 INFO L87 Difference]: Start difference. First operand 353 states and 421 transitions. Second operand 105 states. [2019-10-01 22:40:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:00,301 INFO L93 Difference]: Finished difference Result 574 states and 716 transitions. [2019-10-01 22:40:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-01 22:40:00,302 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 252 [2019-10-01 22:40:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:00,304 INFO L225 Difference]: With dead ends: 574 [2019-10-01 22:40:00,304 INFO L226 Difference]: Without dead ends: 366 [2019-10-01 22:40:00,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3150, Invalid=7770, Unknown=0, NotChecked=0, Total=10920 [2019-10-01 22:40:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-01 22:40:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 361. [2019-10-01 22:40:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-01 22:40:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 431 transitions. [2019-10-01 22:40:00,339 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 431 transitions. Word has length 252 [2019-10-01 22:40:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:00,339 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 431 transitions. [2019-10-01 22:40:00,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-01 22:40:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 431 transitions. [2019-10-01 22:40:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-01 22:40:00,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:00,341 INFO L411 BasicCegarLoop]: trace histogram [70, 70, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:00,341 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash -10697680, now seen corresponding path program 70 times [2019-10-01 22:40:00,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:00,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:00,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2019-10-01 22:40:02,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:02,272 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:40:02,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:40:02,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:40:02,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-01 22:40:02,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2019-10-01 22:40:02,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-10-01 22:40:02,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-01 22:40:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-01 22:40:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:40:02,619 INFO L87 Difference]: Start difference. First operand 361 states and 431 transitions. Second operand 74 states. [2019-10-01 22:40:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:02,858 INFO L93 Difference]: Finished difference Result 578 states and 718 transitions. [2019-10-01 22:40:02,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:40:02,858 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 257 [2019-10-01 22:40:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:02,860 INFO L225 Difference]: With dead ends: 578 [2019-10-01 22:40:02,860 INFO L226 Difference]: Without dead ends: 364 [2019-10-01 22:40:02,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:40:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-01 22:40:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2019-10-01 22:40:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-01 22:40:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 433 transitions. [2019-10-01 22:40:02,867 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 433 transitions. Word has length 257 [2019-10-01 22:40:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:02,867 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 433 transitions. [2019-10-01 22:40:02,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-01 22:40:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 433 transitions. [2019-10-01 22:40:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-01 22:40:02,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:02,870 INFO L411 BasicCegarLoop]: trace histogram [71, 71, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:02,870 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1628080306, now seen corresponding path program 71 times [2019-10-01 22:40:02,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:02,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:02,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6659 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2019-10-01 22:40:04,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:04,875 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:14,650 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-10-01 22:41:14,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:14,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:41:14,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6659 backedges. 1 proven. 1617 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2019-10-01 22:41:16,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:16,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 36] total 108 [2019-10-01 22:41:16,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-10-01 22:41:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-10-01 22:41:16,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3330, Invalid=8226, Unknown=0, NotChecked=0, Total=11556 [2019-10-01 22:41:16,076 INFO L87 Difference]: Start difference. First operand 363 states and 433 transitions. Second operand 108 states. [2019-10-01 22:41:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:16,798 INFO L93 Difference]: Finished difference Result 590 states and 736 transitions. [2019-10-01 22:41:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-10-01 22:41:16,799 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 259 [2019-10-01 22:41:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:16,800 INFO L225 Difference]: With dead ends: 590 [2019-10-01 22:41:16,800 INFO L226 Difference]: Without dead ends: 376 [2019-10-01 22:41:16,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3330, Invalid=8226, Unknown=0, NotChecked=0, Total=11556 [2019-10-01 22:41:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-01 22:41:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 371. [2019-10-01 22:41:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-01 22:41:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 443 transitions. [2019-10-01 22:41:16,807 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 443 transitions. Word has length 259 [2019-10-01 22:41:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:16,807 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 443 transitions. [2019-10-01 22:41:16,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-10-01 22:41:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 443 transitions. [2019-10-01 22:41:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-01 22:41:16,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:16,808 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:16,808 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash -260299941, now seen corresponding path program 72 times [2019-10-01 22:41:16,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:16,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:16,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:16,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [2019-10-01 22:41:18,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:18,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:18,940 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE