/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:15:58,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:15:58,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:15:58,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:15:58,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:15:58,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:15:58,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:15:58,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:15:58,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:15:58,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:15:58,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:15:58,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:15:58,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:15:58,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:15:58,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:15:58,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:15:58,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:15:58,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:15:58,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:15:58,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:15:58,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:15:58,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:15:58,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:15:58,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:15:58,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:15:58,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:15:58,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:15:58,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:15:58,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:15:58,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:15:58,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:15:58,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:15:58,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:15:58,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:15:58,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:15:58,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:15:58,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:15:58,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:15:58,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:15:58,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:15:58,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:15:58,183 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-11-23 21:15:58,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:15:58,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:15:58,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:15:58,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:15:58,206 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:15:58,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:15:58,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:15:58,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:15:58,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:15:58,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:15:58,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:15:58,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:15:58,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:15:58,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:15:58,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:15:58,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:15:58,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:15:58,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:15:58,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:15:58,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:15:58,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:15:58,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:15:58,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:15:58,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:15:58,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:15:58,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:15:58,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:15:58,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:15:58,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:15:58,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:15:58,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:15:58,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:15:58,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:15:58,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:15:58,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:15:58,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label44.c [2019-11-23 21:15:58,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2162f40fd/ce03f67808ee4b8bbf612b82bbed35f9/FLAG59c457967 [2019-11-23 21:15:59,125 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:15:59,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label44.c [2019-11-23 21:15:59,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2162f40fd/ce03f67808ee4b8bbf612b82bbed35f9/FLAG59c457967 [2019-11-23 21:15:59,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2162f40fd/ce03f67808ee4b8bbf612b82bbed35f9 [2019-11-23 21:15:59,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:15:59,319 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:15:59,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:15:59,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:15:59,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:15:59,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:59" (1/1) ... [2019-11-23 21:15:59,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46130874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:59, skipping insertion in model container [2019-11-23 21:15:59,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:59" (1/1) ... [2019-11-23 21:15:59,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:15:59,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:16:00,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:16:00,393 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:16:00,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:16:00,774 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:16:00,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00 WrapperNode [2019-11-23 21:16:00,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:16:00,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:16:00,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:16:00,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:16:00,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:00,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:16:01,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:16:01,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:16:01,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:16:01,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (1/1) ... [2019-11-23 21:16:01,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:16:01,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:16:01,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:16:01,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:16:01,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (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-11-23 21:16:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:16:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:16:04,646 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:16:04,647 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:16:04,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:04 BoogieIcfgContainer [2019-11-23 21:16:04,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:16:04,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:16:04,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:16:04,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:16:04,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:15:59" (1/3) ... [2019-11-23 21:16:04,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd1c8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:04, skipping insertion in model container [2019-11-23 21:16:04,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:00" (2/3) ... [2019-11-23 21:16:04,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd1c8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:04, skipping insertion in model container [2019-11-23 21:16:04,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:04" (3/3) ... [2019-11-23 21:16:04,662 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label44.c [2019-11-23 21:16:04,673 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:16:04,683 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:16:04,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:16:04,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:16:04,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:16:04,746 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:16:04,746 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:16:04,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:16:04,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:16:04,748 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:16:04,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:16:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 21:16:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 21:16:04,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:04,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:04,800 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2019-11-23 21:16:04,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:04,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135536551] [2019-11-23 21:16:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:05,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135536551] [2019-11-23 21:16:05,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:05,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:05,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844175881] [2019-11-23 21:16:05,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:05,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:05,213 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-23 21:16:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:10,201 INFO L93 Difference]: Finished difference Result 1457 states and 2706 transitions. [2019-11-23 21:16:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:10,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-23 21:16:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:10,230 INFO L225 Difference]: With dead ends: 1457 [2019-11-23 21:16:10,230 INFO L226 Difference]: Without dead ends: 965 [2019-11-23 21:16:10,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-11-23 21:16:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 662. [2019-11-23 21:16:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-23 21:16:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 979 transitions. [2019-11-23 21:16:10,326 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 979 transitions. Word has length 66 [2019-11-23 21:16:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:10,326 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 979 transitions. [2019-11-23 21:16:10,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 979 transitions. [2019-11-23 21:16:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 21:16:10,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:10,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:10,333 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash 333594229, now seen corresponding path program 1 times [2019-11-23 21:16:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:10,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005716159] [2019-11-23 21:16:10,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:10,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005716159] [2019-11-23 21:16:10,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:10,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:10,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763265897] [2019-11-23 21:16:10,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:16:10,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:16:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:10,702 INFO L87 Difference]: Start difference. First operand 662 states and 979 transitions. Second operand 5 states. [2019-11-23 21:16:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:14,848 INFO L93 Difference]: Finished difference Result 2244 states and 3236 transitions. [2019-11-23 21:16:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:14,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-23 21:16:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:14,858 INFO L225 Difference]: With dead ends: 2244 [2019-11-23 21:16:14,859 INFO L226 Difference]: Without dead ends: 1584 [2019-11-23 21:16:14,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 21:16:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-23 21:16:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1277. [2019-11-23 21:16:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-11-23 21:16:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1746 transitions. [2019-11-23 21:16:14,937 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1746 transitions. Word has length 131 [2019-11-23 21:16:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:14,940 INFO L462 AbstractCegarLoop]: Abstraction has 1277 states and 1746 transitions. [2019-11-23 21:16:14,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:16:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1746 transitions. [2019-11-23 21:16:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 21:16:14,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:14,953 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:14,953 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1428135620, now seen corresponding path program 1 times [2019-11-23 21:16:14,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:14,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138567178] [2019-11-23 21:16:14,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:15,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138567178] [2019-11-23 21:16:15,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:15,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:15,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944069878] [2019-11-23 21:16:15,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:15,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:15,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:15,175 INFO L87 Difference]: Start difference. First operand 1277 states and 1746 transitions. Second operand 4 states. [2019-11-23 21:16:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:18,961 INFO L93 Difference]: Finished difference Result 4360 states and 6098 transitions. [2019-11-23 21:16:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:18,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-23 21:16:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:18,977 INFO L225 Difference]: With dead ends: 4360 [2019-11-23 21:16:18,978 INFO L226 Difference]: Without dead ends: 3085 [2019-11-23 21:16:18,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2019-11-23 21:16:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3080. [2019-11-23 21:16:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-11-23 21:16:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3988 transitions. [2019-11-23 21:16:19,034 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 3988 transitions. Word has length 136 [2019-11-23 21:16:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:19,034 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 3988 transitions. [2019-11-23 21:16:19,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3988 transitions. [2019-11-23 21:16:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-23 21:16:19,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:19,037 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:19,037 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash 461226345, now seen corresponding path program 1 times [2019-11-23 21:16:19,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:19,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580867537] [2019-11-23 21:16:19,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 21:16:19,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580867537] [2019-11-23 21:16:19,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237993812] [2019-11-23 21:16:19,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:19,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:19,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:19,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:19,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-23 21:16:19,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059415929] [2019-11-23 21:16:19,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:19,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:19,628 INFO L87 Difference]: Start difference. First operand 3080 states and 3988 transitions. Second operand 3 states. [2019-11-23 21:16:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:21,652 INFO L93 Difference]: Finished difference Result 8252 states and 10870 transitions. [2019-11-23 21:16:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:21,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-23 21:16:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:21,676 INFO L225 Difference]: With dead ends: 8252 [2019-11-23 21:16:21,677 INFO L226 Difference]: Without dead ends: 5174 [2019-11-23 21:16:21,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2019-11-23 21:16:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4277. [2019-11-23 21:16:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4277 states. [2019-11-23 21:16:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 5339 transitions. [2019-11-23 21:16:21,821 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 5339 transitions. Word has length 232 [2019-11-23 21:16:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:21,822 INFO L462 AbstractCegarLoop]: Abstraction has 4277 states and 5339 transitions. [2019-11-23 21:16:21,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 5339 transitions. [2019-11-23 21:16:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-23 21:16:21,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:21,828 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:22,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:22,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1527180443, now seen corresponding path program 1 times [2019-11-23 21:16:22,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:22,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756335535] [2019-11-23 21:16:22,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 21:16:22,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756335535] [2019-11-23 21:16:22,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:22,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:22,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685173310] [2019-11-23 21:16:22,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:16:22,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:22,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:16:22,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:22,540 INFO L87 Difference]: Start difference. First operand 4277 states and 5339 transitions. Second operand 5 states. [2019-11-23 21:16:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:26,581 INFO L93 Difference]: Finished difference Result 9452 states and 11656 transitions. [2019-11-23 21:16:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:26,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2019-11-23 21:16:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:26,604 INFO L225 Difference]: With dead ends: 9452 [2019-11-23 21:16:26,605 INFO L226 Difference]: Without dead ends: 5177 [2019-11-23 21:16:26,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2019-11-23 21:16:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 4875. [2019-11-23 21:16:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2019-11-23 21:16:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5967 transitions. [2019-11-23 21:16:26,700 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5967 transitions. Word has length 338 [2019-11-23 21:16:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:26,701 INFO L462 AbstractCegarLoop]: Abstraction has 4875 states and 5967 transitions. [2019-11-23 21:16:26,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:16:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5967 transitions. [2019-11-23 21:16:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-23 21:16:26,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:26,769 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:26,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1227352119, now seen corresponding path program 1 times [2019-11-23 21:16:26,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:26,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644285163] [2019-11-23 21:16:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-23 21:16:27,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644285163] [2019-11-23 21:16:27,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:27,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:27,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332234336] [2019-11-23 21:16:27,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:27,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:27,128 INFO L87 Difference]: Start difference. First operand 4875 states and 5967 transitions. Second operand 4 states. [2019-11-23 21:16:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:30,405 INFO L93 Difference]: Finished difference Result 13047 states and 16083 transitions. [2019-11-23 21:16:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:30,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-11-23 21:16:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:30,436 INFO L225 Difference]: With dead ends: 13047 [2019-11-23 21:16:30,436 INFO L226 Difference]: Without dead ends: 8174 [2019-11-23 21:16:30,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2019-11-23 21:16:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 6375. [2019-11-23 21:16:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2019-11-23 21:16:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 7715 transitions. [2019-11-23 21:16:30,547 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 7715 transitions. Word has length 412 [2019-11-23 21:16:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:30,548 INFO L462 AbstractCegarLoop]: Abstraction has 6375 states and 7715 transitions. [2019-11-23 21:16:30,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 7715 transitions. [2019-11-23 21:16:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-23 21:16:30,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:30,557 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:30,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2078614052, now seen corresponding path program 1 times [2019-11-23 21:16:30,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736242109] [2019-11-23 21:16:30,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 137 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:31,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736242109] [2019-11-23 21:16:31,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378624487] [2019-11-23 21:16:31,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:31,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:31,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:32,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:32,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-23 21:16:32,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783608670] [2019-11-23 21:16:32,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:32,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:16:32,050 INFO L87 Difference]: Start difference. First operand 6375 states and 7715 transitions. Second operand 3 states. [2019-11-23 21:16:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:35,090 INFO L93 Difference]: Finished difference Result 13347 states and 16095 transitions. [2019-11-23 21:16:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:35,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-11-23 21:16:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:35,118 INFO L225 Difference]: With dead ends: 13347 [2019-11-23 21:16:35,119 INFO L226 Difference]: Without dead ends: 6974 [2019-11-23 21:16:35,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:16:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-11-23 21:16:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6673. [2019-11-23 21:16:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2019-11-23 21:16:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 7850 transitions. [2019-11-23 21:16:35,216 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 7850 transitions. Word has length 417 [2019-11-23 21:16:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:35,217 INFO L462 AbstractCegarLoop]: Abstraction has 6673 states and 7850 transitions. [2019-11-23 21:16:35,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 7850 transitions. [2019-11-23 21:16:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-23 21:16:35,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:35,221 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:35,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:35,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1305480874, now seen corresponding path program 1 times [2019-11-23 21:16:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:35,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918337854] [2019-11-23 21:16:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 21:16:35,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918337854] [2019-11-23 21:16:35,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:35,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98770087] [2019-11-23 21:16:35,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:35,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:35,844 INFO L87 Difference]: Start difference. First operand 6673 states and 7850 transitions. Second operand 4 states. [2019-11-23 21:16:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:38,880 INFO L93 Difference]: Finished difference Result 13344 states and 15700 transitions. [2019-11-23 21:16:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:38,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-23 21:16:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:38,893 INFO L225 Difference]: With dead ends: 13344 [2019-11-23 21:16:38,893 INFO L226 Difference]: Without dead ends: 6673 [2019-11-23 21:16:38,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2019-11-23 21:16:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6672. [2019-11-23 21:16:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6672 states. [2019-11-23 21:16:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 7565 transitions. [2019-11-23 21:16:38,971 INFO L78 Accepts]: Start accepts. Automaton has 6672 states and 7565 transitions. Word has length 434 [2019-11-23 21:16:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:38,972 INFO L462 AbstractCegarLoop]: Abstraction has 6672 states and 7565 transitions. [2019-11-23 21:16:38,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6672 states and 7565 transitions. [2019-11-23 21:16:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-11-23 21:16:38,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:38,978 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:38,978 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1447157885, now seen corresponding path program 1 times [2019-11-23 21:16:38,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:38,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053844450] [2019-11-23 21:16:38,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-23 21:16:39,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053844450] [2019-11-23 21:16:39,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:39,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:39,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029597732] [2019-11-23 21:16:39,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:39,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:39,361 INFO L87 Difference]: Start difference. First operand 6672 states and 7565 transitions. Second operand 3 states. [2019-11-23 21:16:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:41,751 INFO L93 Difference]: Finished difference Result 15733 states and 18096 transitions. [2019-11-23 21:16:41,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:41,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 530 [2019-11-23 21:16:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:41,768 INFO L225 Difference]: With dead ends: 15733 [2019-11-23 21:16:41,768 INFO L226 Difference]: Without dead ends: 9063 [2019-11-23 21:16:41,775 INFO L630 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-11-23 21:16:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2019-11-23 21:16:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2019-11-23 21:16:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-11-23 21:16:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 10362 transitions. [2019-11-23 21:16:41,875 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 10362 transitions. Word has length 530 [2019-11-23 21:16:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:41,876 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 10362 transitions. [2019-11-23 21:16:41,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 10362 transitions. [2019-11-23 21:16:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-11-23 21:16:41,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:41,886 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:41,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1866992391, now seen corresponding path program 1 times [2019-11-23 21:16:41,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:41,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385691586] [2019-11-23 21:16:41,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 660 proven. 3 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-23 21:16:42,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385691586] [2019-11-23 21:16:42,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867166680] [2019-11-23 21:16:42,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:43,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:16:43,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:43,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:16:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-23 21:16:43,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:16:43,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-23 21:16:43,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054002604] [2019-11-23 21:16:43,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:16:43,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:16:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:43,654 INFO L87 Difference]: Start difference. First operand 9063 states and 10362 transitions. Second operand 9 states. [2019-11-23 21:16:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:51,512 INFO L93 Difference]: Finished difference Result 23362 states and 26503 transitions. [2019-11-23 21:16:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:16:51,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 621 [2019-11-23 21:16:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:51,530 INFO L225 Difference]: With dead ends: 23362 [2019-11-23 21:16:51,531 INFO L226 Difference]: Without dead ends: 10856 [2019-11-23 21:16:51,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:16:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2019-11-23 21:16:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 7865. [2019-11-23 21:16:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7865 states. [2019-11-23 21:16:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7865 states to 7865 states and 8367 transitions. [2019-11-23 21:16:51,632 INFO L78 Accepts]: Start accepts. Automaton has 7865 states and 8367 transitions. Word has length 621 [2019-11-23 21:16:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:51,633 INFO L462 AbstractCegarLoop]: Abstraction has 7865 states and 8367 transitions. [2019-11-23 21:16:51,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:16:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7865 states and 8367 transitions. [2019-11-23 21:16:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-11-23 21:16:51,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:51,642 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:51,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:51,854 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1111780767, now seen corresponding path program 1 times [2019-11-23 21:16:51,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:51,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15259216] [2019-11-23 21:16:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-11-23 21:16:52,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15259216] [2019-11-23 21:16:52,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:52,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:52,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117510890] [2019-11-23 21:16:52,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:52,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:52,439 INFO L87 Difference]: Start difference. First operand 7865 states and 8367 transitions. Second operand 3 states. [2019-11-23 21:16:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:53,739 INFO L93 Difference]: Finished difference Result 15726 states and 16730 transitions. [2019-11-23 21:16:53,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:53,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-11-23 21:16:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:53,746 INFO L225 Difference]: With dead ends: 15726 [2019-11-23 21:16:53,746 INFO L226 Difference]: Without dead ends: 7863 [2019-11-23 21:16:53,752 INFO L630 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-11-23 21:16:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2019-11-23 21:16:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7863. [2019-11-23 21:16:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7863 states. [2019-11-23 21:16:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7863 states to 7863 states and 8363 transitions. [2019-11-23 21:16:53,838 INFO L78 Accepts]: Start accepts. Automaton has 7863 states and 8363 transitions. Word has length 663 [2019-11-23 21:16:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:53,839 INFO L462 AbstractCegarLoop]: Abstraction has 7863 states and 8363 transitions. [2019-11-23 21:16:53,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7863 states and 8363 transitions. [2019-11-23 21:16:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-11-23 21:16:53,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:53,849 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:53,849 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash 696170776, now seen corresponding path program 1 times [2019-11-23 21:16:53,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:53,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111090430] [2019-11-23 21:16:53,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 525 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-23 21:16:54,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111090430] [2019-11-23 21:16:54,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305736577] [2019-11-23 21:16:54,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:55,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:55,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-23 21:16:55,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:55,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-23 21:16:55,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247688280] [2019-11-23 21:16:55,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:55,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:55,257 INFO L87 Difference]: Start difference. First operand 7863 states and 8363 transitions. Second operand 3 states. [2019-11-23 21:16:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:56,454 INFO L93 Difference]: Finished difference Result 15725 states and 16726 transitions. [2019-11-23 21:16:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:56,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2019-11-23 21:16:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:56,463 INFO L225 Difference]: With dead ends: 15725 [2019-11-23 21:16:56,463 INFO L226 Difference]: Without dead ends: 7864 [2019-11-23 21:16:56,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 677 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2019-11-23 21:16:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 7861. [2019-11-23 21:16:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2019-11-23 21:16:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 8288 transitions. [2019-11-23 21:16:56,544 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 8288 transitions. Word has length 676 [2019-11-23 21:16:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:56,545 INFO L462 AbstractCegarLoop]: Abstraction has 7861 states and 8288 transitions. [2019-11-23 21:16:56,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 8288 transitions. [2019-11-23 21:16:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-23 21:16:56,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:56,555 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:56,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:56,759 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1189188974, now seen corresponding path program 1 times [2019-11-23 21:16:56,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:56,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53165916] [2019-11-23 21:16:56,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:16:57,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53165916] [2019-11-23 21:16:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:57,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:57,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680350257] [2019-11-23 21:16:57,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:57,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:57,380 INFO L87 Difference]: Start difference. First operand 7861 states and 8288 transitions. Second operand 4 states. [2019-11-23 21:16:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:59,090 INFO L93 Difference]: Finished difference Result 16276 states and 17083 transitions. [2019-11-23 21:16:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:59,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2019-11-23 21:16:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:59,100 INFO L225 Difference]: With dead ends: 16276 [2019-11-23 21:16:59,100 INFO L226 Difference]: Without dead ends: 7819 [2019-11-23 21:16:59,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-11-23 21:16:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 6320. [2019-11-23 21:16:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2019-11-23 21:16:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6499 transitions. [2019-11-23 21:16:59,155 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6499 transitions. Word has length 691 [2019-11-23 21:16:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:59,156 INFO L462 AbstractCegarLoop]: Abstraction has 6320 states and 6499 transitions. [2019-11-23 21:16:59,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6499 transitions. [2019-11-23 21:16:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-11-23 21:16:59,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:59,165 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:59,165 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2083360250, now seen corresponding path program 1 times [2019-11-23 21:16:59,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:59,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889777546] [2019-11-23 21:16:59,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 85 proven. 804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:17:00,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889777546] [2019-11-23 21:17:00,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941002749] [2019-11-23 21:17:00,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:00,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:17:00,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:17:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:00,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-23 21:17:01,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:17:01,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-23 21:17:01,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026456161] [2019-11-23 21:17:01,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:01,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:17:01,160 INFO L87 Difference]: Start difference. First operand 6320 states and 6499 transitions. Second operand 3 states. [2019-11-23 21:17:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:14,062 INFO L93 Difference]: Finished difference Result 15043 states and 15511 transitions. [2019-11-23 21:17:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:14,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 698 [2019-11-23 21:17:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:14,070 INFO L225 Difference]: With dead ends: 15043 [2019-11-23 21:17:14,070 INFO L226 Difference]: Without dead ends: 8725 [2019-11-23 21:17:14,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:17:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2019-11-23 21:17:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8120. [2019-11-23 21:17:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8120 states. [2019-11-23 21:17:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8120 states to 8120 states and 8371 transitions. [2019-11-23 21:17:14,142 INFO L78 Accepts]: Start accepts. Automaton has 8120 states and 8371 transitions. Word has length 698 [2019-11-23 21:17:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:14,143 INFO L462 AbstractCegarLoop]: Abstraction has 8120 states and 8371 transitions. [2019-11-23 21:17:14,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8120 states and 8371 transitions. [2019-11-23 21:17:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2019-11-23 21:17:14,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:14,169 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:14,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:14,373 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -384171549, now seen corresponding path program 1 times [2019-11-23 21:17:14,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:14,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352889148] [2019-11-23 21:17:14,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-23 21:17:15,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352889148] [2019-11-23 21:17:15,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:15,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:15,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620710016] [2019-11-23 21:17:15,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:15,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:15,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:17:15,210 INFO L87 Difference]: Start difference. First operand 8120 states and 8371 transitions. Second operand 3 states. [2019-11-23 21:17:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:16,411 INFO L93 Difference]: Finished difference Result 19227 states and 19855 transitions. [2019-11-23 21:17:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:16,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 908 [2019-11-23 21:17:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:16,422 INFO L225 Difference]: With dead ends: 19227 [2019-11-23 21:17:16,422 INFO L226 Difference]: Without dead ends: 11408 [2019-11-23 21:17:16,426 INFO L630 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-11-23 21:17:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11408 states. [2019-11-23 21:17:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11408 to 10212. [2019-11-23 21:17:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10212 states. [2019-11-23 21:17:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 10499 transitions. [2019-11-23 21:17:16,545 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 10499 transitions. Word has length 908 [2019-11-23 21:17:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:16,546 INFO L462 AbstractCegarLoop]: Abstraction has 10212 states and 10499 transitions. [2019-11-23 21:17:16,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 10499 transitions. [2019-11-23 21:17:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-23 21:17:16,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:16,564 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:16,565 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1617243607, now seen corresponding path program 1 times [2019-11-23 21:17:16,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:16,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114225652] [2019-11-23 21:17:16,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-23 21:17:17,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114225652] [2019-11-23 21:17:17,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:17,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:17,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543164808] [2019-11-23 21:17:17,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:17,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:17:17,647 INFO L87 Difference]: Start difference. First operand 10212 states and 10499 transitions. Second operand 3 states. [2019-11-23 21:17:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:18,786 INFO L93 Difference]: Finished difference Result 22819 states and 23483 transitions. [2019-11-23 21:17:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:18,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 922 [2019-11-23 21:17:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:18,800 INFO L225 Difference]: With dead ends: 22819 [2019-11-23 21:17:18,800 INFO L226 Difference]: Without dead ends: 12908 [2019-11-23 21:17:18,807 INFO L630 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-11-23 21:17:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12908 states. [2019-11-23 21:17:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12908 to 12303. [2019-11-23 21:17:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-11-23 21:17:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 12652 transitions. [2019-11-23 21:17:18,937 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 12652 transitions. Word has length 922 [2019-11-23 21:17:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:18,938 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 12652 transitions. [2019-11-23 21:17:18,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 12652 transitions. [2019-11-23 21:17:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-23 21:17:18,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:18,957 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:18,957 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1236328096, now seen corresponding path program 1 times [2019-11-23 21:17:18,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:18,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239559949] [2019-11-23 21:17:18,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 77 proven. 1322 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-23 21:17:21,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239559949] [2019-11-23 21:17:21,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620719757] [2019-11-23 21:17:21,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:21,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:17:21,520 INFO L278 TraceCheckSpWp]: Computing forward predicates...