/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/systemc/transmitter.05.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:50:20,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:50:20,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:50:20,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:50:20,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:50:20,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:50:20,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:50:20,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:50:20,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:50:20,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:50:20,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:50:20,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:50:20,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:50:20,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:50:20,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:50:20,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:50:20,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:50:20,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:50:20,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:50:20,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:50:20,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:50:20,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:50:20,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:50:20,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:50:20,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:50:20,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:50:20,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:50:20,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:50:20,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:50:20,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:50:20,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:50:20,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:50:20,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:50:20,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:50:20,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:50:20,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:50:20,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:50:20,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:50:20,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:50:20,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:50:20,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:50:20,302 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 22:50:20,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:50:20,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:50:20,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:50:20,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:50:20,319 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:50:20,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:50:20,320 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:50:20,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:50:20,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:50:20,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:50:20,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:50:20,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:50:20,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:50:20,321 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:50:20,321 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:50:20,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:50:20,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:50:20,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:50:20,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:50:20,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:50:20,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:50:20,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:50:20,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:20,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:50:20,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:50:20,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:50:20,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:50:20,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:50:20,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:50:20,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:50:20,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:50:20,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:50:20,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:50:20,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:50:20,596 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:50:20,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-11-23 22:50:20,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7f91ead/42c55dab1416463c8360cb6ddd056e3f/FLAG738afce43 [2019-11-23 22:50:21,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:50:21,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-11-23 22:50:21,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7f91ead/42c55dab1416463c8360cb6ddd056e3f/FLAG738afce43 [2019-11-23 22:50:21,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7f91ead/42c55dab1416463c8360cb6ddd056e3f [2019-11-23 22:50:21,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:50:21,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:50:21,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:21,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:50:21,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:50:21,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:21" (1/1) ... [2019-11-23 22:50:21,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26810287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:21, skipping insertion in model container [2019-11-23 22:50:21,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:21" (1/1) ... [2019-11-23 22:50:21,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:50:21,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:50:21,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:21,870 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:50:22,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:22,041 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:50:22,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22 WrapperNode [2019-11-23 22:50:22,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:22,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:22,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:50:22,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:50:22,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:22,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:50:22,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:50:22,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:50:22,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (1/1) ... [2019-11-23 22:50:22,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:50:22,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:50:22,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:50:22,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:50:22,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (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 22:50:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:50:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:50:23,587 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:50:23,588 INFO L284 CfgBuilder]: Removed 181 assume(true) statements. [2019-11-23 22:50:23,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:23 BoogieIcfgContainer [2019-11-23 22:50:23,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:50:23,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:50:23,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:50:23,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:50:23,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:50:21" (1/3) ... [2019-11-23 22:50:23,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb41100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:23, skipping insertion in model container [2019-11-23 22:50:23,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:22" (2/3) ... [2019-11-23 22:50:23,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb41100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:23, skipping insertion in model container [2019-11-23 22:50:23,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:23" (3/3) ... [2019-11-23 22:50:23,601 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2019-11-23 22:50:23,611 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:50:23,619 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:50:23,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:50:23,674 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:50:23,674 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:50:23,674 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:50:23,675 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:50:23,675 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:50:23,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:50:23,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:50:23,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:50:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states. [2019-11-23 22:50:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:23,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:23,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:23,731 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1912114834, now seen corresponding path program 1 times [2019-11-23 22:50:23,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:23,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165511952] [2019-11-23 22:50:23,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:23,936 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 22:50:23,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165511952] [2019-11-23 22:50:23,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:23,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:23,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868198876] [2019-11-23 22:50:23,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:23,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:23,963 INFO L87 Difference]: Start difference. First operand 486 states. Second operand 3 states. [2019-11-23 22:50:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:24,097 INFO L93 Difference]: Finished difference Result 967 states and 1501 transitions. [2019-11-23 22:50:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:24,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:24,119 INFO L225 Difference]: With dead ends: 967 [2019-11-23 22:50:24,119 INFO L226 Difference]: Without dead ends: 482 [2019-11-23 22:50:24,125 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 22:50:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-23 22:50:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-23 22:50:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-23 22:50:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 730 transitions. [2019-11-23 22:50:24,200 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 730 transitions. Word has length 85 [2019-11-23 22:50:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:24,200 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 730 transitions. [2019-11-23 22:50:24,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 730 transitions. [2019-11-23 22:50:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:24,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:24,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:24,205 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1325014384, now seen corresponding path program 1 times [2019-11-23 22:50:24,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:24,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378526188] [2019-11-23 22:50:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:24,281 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 22:50:24,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378526188] [2019-11-23 22:50:24,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:24,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:24,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372703497] [2019-11-23 22:50:24,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:24,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:24,285 INFO L87 Difference]: Start difference. First operand 482 states and 730 transitions. Second operand 3 states. [2019-11-23 22:50:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:24,389 INFO L93 Difference]: Finished difference Result 1320 states and 1994 transitions. [2019-11-23 22:50:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:24,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:24,396 INFO L225 Difference]: With dead ends: 1320 [2019-11-23 22:50:24,396 INFO L226 Difference]: Without dead ends: 848 [2019-11-23 22:50:24,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-11-23 22:50:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-11-23 22:50:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1268 transitions. [2019-11-23 22:50:24,464 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1268 transitions. Word has length 85 [2019-11-23 22:50:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:24,465 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1268 transitions. [2019-11-23 22:50:24,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1268 transitions. [2019-11-23 22:50:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:24,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:24,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:24,476 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1311229201, now seen corresponding path program 1 times [2019-11-23 22:50:24,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:24,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91356607] [2019-11-23 22:50:24,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:24,550 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 22:50:24,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91356607] [2019-11-23 22:50:24,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:24,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:24,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330145248] [2019-11-23 22:50:24,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:24,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:24,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:24,557 INFO L87 Difference]: Start difference. First operand 846 states and 1268 transitions. Second operand 3 states. [2019-11-23 22:50:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:24,623 INFO L93 Difference]: Finished difference Result 1681 states and 2519 transitions. [2019-11-23 22:50:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:24,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:24,629 INFO L225 Difference]: With dead ends: 1681 [2019-11-23 22:50:24,629 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:24,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1260 transitions. [2019-11-23 22:50:24,665 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1260 transitions. Word has length 85 [2019-11-23 22:50:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:24,665 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1260 transitions. [2019-11-23 22:50:24,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1260 transitions. [2019-11-23 22:50:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:24,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:24,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:24,667 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash -86597841, now seen corresponding path program 1 times [2019-11-23 22:50:24,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:24,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513106190] [2019-11-23 22:50:24,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:24,746 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 22:50:24,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513106190] [2019-11-23 22:50:24,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:24,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:24,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244815299] [2019-11-23 22:50:24,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:24,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:24,750 INFO L87 Difference]: Start difference. First operand 846 states and 1260 transitions. Second operand 3 states. [2019-11-23 22:50:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:24,804 INFO L93 Difference]: Finished difference Result 1680 states and 2502 transitions. [2019-11-23 22:50:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:24,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:24,810 INFO L225 Difference]: With dead ends: 1680 [2019-11-23 22:50:24,810 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:24,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1252 transitions. [2019-11-23 22:50:24,850 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1252 transitions. Word has length 85 [2019-11-23 22:50:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:24,850 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1252 transitions. [2019-11-23 22:50:24,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1252 transitions. [2019-11-23 22:50:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:24,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:24,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:24,855 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1571114257, now seen corresponding path program 1 times [2019-11-23 22:50:24,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:24,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209576551] [2019-11-23 22:50:24,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:24,950 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 22:50:24,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209576551] [2019-11-23 22:50:24,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:24,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:24,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936604257] [2019-11-23 22:50:24,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:24,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:24,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:24,954 INFO L87 Difference]: Start difference. First operand 846 states and 1252 transitions. Second operand 3 states. [2019-11-23 22:50:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:25,011 INFO L93 Difference]: Finished difference Result 1678 states and 2483 transitions. [2019-11-23 22:50:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:25,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:25,018 INFO L225 Difference]: With dead ends: 1678 [2019-11-23 22:50:25,018 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:25,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1244 transitions. [2019-11-23 22:50:25,057 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1244 transitions. Word has length 85 [2019-11-23 22:50:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,058 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1244 transitions. [2019-11-23 22:50:25,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1244 transitions. [2019-11-23 22:50:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:25,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:25,060 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1353664849, now seen corresponding path program 1 times [2019-11-23 22:50:25,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137713175] [2019-11-23 22:50:25,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,155 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 22:50:25,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137713175] [2019-11-23 22:50:25,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187887772] [2019-11-23 22:50:25,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,159 INFO L87 Difference]: Start difference. First operand 846 states and 1244 transitions. Second operand 3 states. [2019-11-23 22:50:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:25,228 INFO L93 Difference]: Finished difference Result 1677 states and 2466 transitions. [2019-11-23 22:50:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:25,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:25,233 INFO L225 Difference]: With dead ends: 1677 [2019-11-23 22:50:25,233 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:25,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1236 transitions. [2019-11-23 22:50:25,270 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1236 transitions. Word has length 85 [2019-11-23 22:50:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,270 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1236 transitions. [2019-11-23 22:50:25,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1236 transitions. [2019-11-23 22:50:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:25,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:25,272 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1839938287, now seen corresponding path program 1 times [2019-11-23 22:50:25,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544512076] [2019-11-23 22:50:25,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,336 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 22:50:25,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544512076] [2019-11-23 22:50:25,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529709196] [2019-11-23 22:50:25,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,343 INFO L87 Difference]: Start difference. First operand 846 states and 1236 transitions. Second operand 3 states. [2019-11-23 22:50:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:25,432 INFO L93 Difference]: Finished difference Result 1676 states and 2449 transitions. [2019-11-23 22:50:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:25,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:25,437 INFO L225 Difference]: With dead ends: 1676 [2019-11-23 22:50:25,437 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:25,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1216 transitions. [2019-11-23 22:50:25,476 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1216 transitions. Word has length 85 [2019-11-23 22:50:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,477 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1216 transitions. [2019-11-23 22:50:25,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1216 transitions. [2019-11-23 22:50:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:25,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:25,478 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1688218612, now seen corresponding path program 1 times [2019-11-23 22:50:25,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995083518] [2019-11-23 22:50:25,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,533 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 22:50:25,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995083518] [2019-11-23 22:50:25,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226113024] [2019-11-23 22:50:25,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,536 INFO L87 Difference]: Start difference. First operand 846 states and 1216 transitions. Second operand 3 states. [2019-11-23 22:50:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:25,632 INFO L93 Difference]: Finished difference Result 1675 states and 2408 transitions. [2019-11-23 22:50:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:25,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:25,639 INFO L225 Difference]: With dead ends: 1675 [2019-11-23 22:50:25,640 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:25,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1196 transitions. [2019-11-23 22:50:25,693 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1196 transitions. Word has length 85 [2019-11-23 22:50:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,693 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1196 transitions. [2019-11-23 22:50:25,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1196 transitions. [2019-11-23 22:50:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:25,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:25,696 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1961990068, now seen corresponding path program 1 times [2019-11-23 22:50:25,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843548258] [2019-11-23 22:50:25,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,746 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 22:50:25,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843548258] [2019-11-23 22:50:25,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818465117] [2019-11-23 22:50:25,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,793 INFO L87 Difference]: Start difference. First operand 846 states and 1196 transitions. Second operand 3 states. [2019-11-23 22:50:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:25,876 INFO L93 Difference]: Finished difference Result 1674 states and 2367 transitions. [2019-11-23 22:50:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:25,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:25,882 INFO L225 Difference]: With dead ends: 1674 [2019-11-23 22:50:25,882 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:25,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1176 transitions. [2019-11-23 22:50:25,921 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1176 transitions. Word has length 85 [2019-11-23 22:50:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,922 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1176 transitions. [2019-11-23 22:50:25,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1176 transitions. [2019-11-23 22:50:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:25,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:25,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1893352853, now seen corresponding path program 1 times [2019-11-23 22:50:25,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602798491] [2019-11-23 22:50:25,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,953 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 22:50:25,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602798491] [2019-11-23 22:50:25,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273518450] [2019-11-23 22:50:25,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,956 INFO L87 Difference]: Start difference. First operand 846 states and 1176 transitions. Second operand 3 states. [2019-11-23 22:50:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:26,034 INFO L93 Difference]: Finished difference Result 1673 states and 2326 transitions. [2019-11-23 22:50:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:26,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:26,039 INFO L225 Difference]: With dead ends: 1673 [2019-11-23 22:50:26,039 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:26,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1156 transitions. [2019-11-23 22:50:26,088 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1156 transitions. Word has length 85 [2019-11-23 22:50:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:26,095 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1156 transitions. [2019-11-23 22:50:26,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1156 transitions. [2019-11-23 22:50:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:26,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:26,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:26,099 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 367812267, now seen corresponding path program 1 times [2019-11-23 22:50:26,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:26,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930331320] [2019-11-23 22:50:26,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:26,135 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 22:50:26,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930331320] [2019-11-23 22:50:26,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:26,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:26,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694141523] [2019-11-23 22:50:26,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:26,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:26,138 INFO L87 Difference]: Start difference. First operand 846 states and 1156 transitions. Second operand 3 states. [2019-11-23 22:50:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:26,242 INFO L93 Difference]: Finished difference Result 1672 states and 2285 transitions. [2019-11-23 22:50:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:26,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:26,248 INFO L225 Difference]: With dead ends: 1672 [2019-11-23 22:50:26,248 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:26,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1136 transitions. [2019-11-23 22:50:26,310 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1136 transitions. Word has length 85 [2019-11-23 22:50:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:26,311 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1136 transitions. [2019-11-23 22:50:26,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1136 transitions. [2019-11-23 22:50:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:26,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:26,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:26,314 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash 613218122, now seen corresponding path program 1 times [2019-11-23 22:50:26,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752697428] [2019-11-23 22:50:26,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:26,378 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 22:50:26,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752697428] [2019-11-23 22:50:26,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:26,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:26,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810134183] [2019-11-23 22:50:26,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:26,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:26,380 INFO L87 Difference]: Start difference. First operand 846 states and 1136 transitions. Second operand 3 states. [2019-11-23 22:50:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:26,474 INFO L93 Difference]: Finished difference Result 1679 states and 2253 transitions. [2019-11-23 22:50:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:26,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:26,479 INFO L225 Difference]: With dead ends: 1679 [2019-11-23 22:50:26,480 INFO L226 Difference]: Without dead ends: 846 [2019-11-23 22:50:26,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-23 22:50:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-11-23 22:50:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-23 22:50:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1128 transitions. [2019-11-23 22:50:26,522 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1128 transitions. Word has length 85 [2019-11-23 22:50:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:26,522 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1128 transitions. [2019-11-23 22:50:26,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1128 transitions. [2019-11-23 22:50:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:50:26,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:26,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:26,524 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash 675257736, now seen corresponding path program 1 times [2019-11-23 22:50:26,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:26,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564919969] [2019-11-23 22:50:26,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:26,570 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 22:50:26,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564919969] [2019-11-23 22:50:26,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:26,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:26,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938809507] [2019-11-23 22:50:26,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:26,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:26,573 INFO L87 Difference]: Start difference. First operand 846 states and 1128 transitions. Second operand 3 states. [2019-11-23 22:50:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:26,701 INFO L93 Difference]: Finished difference Result 2409 states and 3196 transitions. [2019-11-23 22:50:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:26,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:50:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:26,710 INFO L225 Difference]: With dead ends: 2409 [2019-11-23 22:50:26,710 INFO L226 Difference]: Without dead ends: 1636 [2019-11-23 22:50:26,712 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 22:50:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-11-23 22:50:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1558. [2019-11-23 22:50:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-23 22:50:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2051 transitions. [2019-11-23 22:50:26,798 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2051 transitions. Word has length 85 [2019-11-23 22:50:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:26,800 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2051 transitions. [2019-11-23 22:50:26,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2051 transitions. [2019-11-23 22:50:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:50:26,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:26,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:26,802 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1992098123, now seen corresponding path program 1 times [2019-11-23 22:50:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:26,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930617373] [2019-11-23 22:50:26,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:26,857 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 22:50:26,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930617373] [2019-11-23 22:50:26,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:26,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:26,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709864954] [2019-11-23 22:50:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:26,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:26,861 INFO L87 Difference]: Start difference. First operand 1558 states and 2051 transitions. Second operand 3 states. [2019-11-23 22:50:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:27,061 INFO L93 Difference]: Finished difference Result 4298 states and 5657 transitions. [2019-11-23 22:50:27,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:27,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 22:50:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:27,075 INFO L225 Difference]: With dead ends: 4298 [2019-11-23 22:50:27,075 INFO L226 Difference]: Without dead ends: 2882 [2019-11-23 22:50:27,078 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 22:50:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2019-11-23 22:50:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2756. [2019-11-23 22:50:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2019-11-23 22:50:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3610 transitions. [2019-11-23 22:50:27,236 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3610 transitions. Word has length 86 [2019-11-23 22:50:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:27,236 INFO L462 AbstractCegarLoop]: Abstraction has 2756 states and 3610 transitions. [2019-11-23 22:50:27,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3610 transitions. [2019-11-23 22:50:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-23 22:50:27,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:27,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:27,239 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1848388678, now seen corresponding path program 1 times [2019-11-23 22:50:27,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:27,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700423883] [2019-11-23 22:50:27,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:27,293 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 22:50:27,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700423883] [2019-11-23 22:50:27,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:27,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:27,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719012137] [2019-11-23 22:50:27,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:27,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:27,296 INFO L87 Difference]: Start difference. First operand 2756 states and 3610 transitions. Second operand 3 states. [2019-11-23 22:50:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:27,628 INFO L93 Difference]: Finished difference Result 7908 states and 10340 transitions. [2019-11-23 22:50:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:27,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-23 22:50:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:27,655 INFO L225 Difference]: With dead ends: 7908 [2019-11-23 22:50:27,656 INFO L226 Difference]: Without dead ends: 5294 [2019-11-23 22:50:27,662 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 22:50:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2019-11-23 22:50:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5100. [2019-11-23 22:50:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5100 states. [2019-11-23 22:50:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 6642 transitions. [2019-11-23 22:50:27,935 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 6642 transitions. Word has length 87 [2019-11-23 22:50:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:27,936 INFO L462 AbstractCegarLoop]: Abstraction has 5100 states and 6642 transitions. [2019-11-23 22:50:27,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 6642 transitions. [2019-11-23 22:50:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-23 22:50:27,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:27,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:27,938 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash -281630728, now seen corresponding path program 1 times [2019-11-23 22:50:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:27,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709764014] [2019-11-23 22:50:27,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:27,958 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 22:50:27,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709764014] [2019-11-23 22:50:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:27,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377601588] [2019-11-23 22:50:27,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:27,961 INFO L87 Difference]: Start difference. First operand 5100 states and 6642 transitions. Second operand 3 states. [2019-11-23 22:50:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:28,238 INFO L93 Difference]: Finished difference Result 9988 states and 13021 transitions. [2019-11-23 22:50:28,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:28,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-23 22:50:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:28,261 INFO L225 Difference]: With dead ends: 9988 [2019-11-23 22:50:28,261 INFO L226 Difference]: Without dead ends: 4966 [2019-11-23 22:50:28,268 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 22:50:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2019-11-23 22:50:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4966. [2019-11-23 22:50:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4966 states. [2019-11-23 22:50:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4966 states to 4966 states and 6476 transitions. [2019-11-23 22:50:28,575 INFO L78 Accepts]: Start accepts. Automaton has 4966 states and 6476 transitions. Word has length 87 [2019-11-23 22:50:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:28,576 INFO L462 AbstractCegarLoop]: Abstraction has 4966 states and 6476 transitions. [2019-11-23 22:50:28,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4966 states and 6476 transitions. [2019-11-23 22:50:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-23 22:50:28,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:28,579 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, 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 22:50:28,579 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1875736048, now seen corresponding path program 1 times [2019-11-23 22:50:28,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:28,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479937953] [2019-11-23 22:50:28,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:28,633 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 22:50:28,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479937953] [2019-11-23 22:50:28,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:28,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:28,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580043955] [2019-11-23 22:50:28,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:28,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:28,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,636 INFO L87 Difference]: Start difference. First operand 4966 states and 6476 transitions. Second operand 3 states. [2019-11-23 22:50:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,232 INFO L93 Difference]: Finished difference Result 14238 states and 18538 transitions. [2019-11-23 22:50:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-23 22:50:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,273 INFO L225 Difference]: With dead ends: 14238 [2019-11-23 22:50:29,273 INFO L226 Difference]: Without dead ends: 9414 [2019-11-23 22:50:29,282 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 22:50:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9414 states. [2019-11-23 22:50:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9414 to 9140. [2019-11-23 22:50:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9140 states. [2019-11-23 22:50:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9140 states to 9140 states and 11860 transitions. [2019-11-23 22:50:29,743 INFO L78 Accepts]: Start accepts. Automaton has 9140 states and 11860 transitions. Word has length 88 [2019-11-23 22:50:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,744 INFO L462 AbstractCegarLoop]: Abstraction has 9140 states and 11860 transitions. [2019-11-23 22:50:29,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 9140 states and 11860 transitions. [2019-11-23 22:50:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-23 22:50:29,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,746 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, 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 22:50:29,747 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 41013040, now seen corresponding path program 1 times [2019-11-23 22:50:29,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389238793] [2019-11-23 22:50:29,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,767 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 22:50:29,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389238793] [2019-11-23 22:50:29,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:29,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280948713] [2019-11-23 22:50:29,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,769 INFO L87 Difference]: Start difference. First operand 9140 states and 11860 transitions. Second operand 3 states. [2019-11-23 22:50:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:30,099 INFO L93 Difference]: Finished difference Result 18056 states and 23445 transitions. [2019-11-23 22:50:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:30,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-23 22:50:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:30,119 INFO L225 Difference]: With dead ends: 18056 [2019-11-23 22:50:30,119 INFO L226 Difference]: Without dead ends: 9008 [2019-11-23 22:50:30,133 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 22:50:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2019-11-23 22:50:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 9008. [2019-11-23 22:50:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-23 22:50:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 11698 transitions. [2019-11-23 22:50:30,631 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 11698 transitions. Word has length 88 [2019-11-23 22:50:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,632 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 11698 transitions. [2019-11-23 22:50:30,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 11698 transitions. [2019-11-23 22:50:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 22:50:30,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,634 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, 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 22:50:30,634 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -465206145, now seen corresponding path program 1 times [2019-11-23 22:50:30,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534479777] [2019-11-23 22:50:30,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,672 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 22:50:30,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534479777] [2019-11-23 22:50:30,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:30,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425354205] [2019-11-23 22:50:30,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,676 INFO L87 Difference]: Start difference. First operand 9008 states and 11698 transitions. Second operand 3 states. [2019-11-23 22:50:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,345 INFO L93 Difference]: Finished difference Result 25648 states and 33248 transitions. [2019-11-23 22:50:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 22:50:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,376 INFO L225 Difference]: With dead ends: 25648 [2019-11-23 22:50:31,376 INFO L226 Difference]: Without dead ends: 16782 [2019-11-23 22:50:31,391 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 22:50:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2019-11-23 22:50:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16460. [2019-11-23 22:50:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16460 states. [2019-11-23 22:50:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16460 states to 16460 states and 21266 transitions. [2019-11-23 22:50:32,603 INFO L78 Accepts]: Start accepts. Automaton has 16460 states and 21266 transitions. Word has length 89 [2019-11-23 22:50:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:32,603 INFO L462 AbstractCegarLoop]: Abstraction has 16460 states and 21266 transitions. [2019-11-23 22:50:32,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16460 states and 21266 transitions. [2019-11-23 22:50:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 22:50:32,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:32,606 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, 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 22:50:32,606 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:32,607 INFO L82 PathProgramCache]: Analyzing trace with hash -270255493, now seen corresponding path program 1 times [2019-11-23 22:50:32,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:32,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051094366] [2019-11-23 22:50:32,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:32,628 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 22:50:32,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051094366] [2019-11-23 22:50:32,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:32,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:32,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44019575] [2019-11-23 22:50:32,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:32,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:32,630 INFO L87 Difference]: Start difference. First operand 16460 states and 21266 transitions. Second operand 3 states. [2019-11-23 22:50:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:33,171 INFO L93 Difference]: Finished difference Result 32684 states and 42245 transitions. [2019-11-23 22:50:33,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:33,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 22:50:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:33,204 INFO L225 Difference]: With dead ends: 32684 [2019-11-23 22:50:33,204 INFO L226 Difference]: Without dead ends: 16330 [2019-11-23 22:50:33,222 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 22:50:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16330 states. [2019-11-23 22:50:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16330 to 16330. [2019-11-23 22:50:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16330 states. [2019-11-23 22:50:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16330 states to 16330 states and 21108 transitions. [2019-11-23 22:50:33,848 INFO L78 Accepts]: Start accepts. Automaton has 16330 states and 21108 transitions. Word has length 89 [2019-11-23 22:50:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:33,848 INFO L462 AbstractCegarLoop]: Abstraction has 16330 states and 21108 transitions. [2019-11-23 22:50:33,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16330 states and 21108 transitions. [2019-11-23 22:50:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 22:50:33,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:33,850 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, 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 22:50:33,850 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1860831531, now seen corresponding path program 1 times [2019-11-23 22:50:33,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:33,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5128832] [2019-11-23 22:50:33,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:33,888 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 22:50:33,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5128832] [2019-11-23 22:50:33,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:33,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:33,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647561078] [2019-11-23 22:50:33,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:33,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:33,890 INFO L87 Difference]: Start difference. First operand 16330 states and 21108 transitions. Second operand 3 states. [2019-11-23 22:50:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:34,773 INFO L93 Difference]: Finished difference Result 48414 states and 62601 transitions. [2019-11-23 22:50:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:34,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-23 22:50:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:34,822 INFO L225 Difference]: With dead ends: 48414 [2019-11-23 22:50:34,822 INFO L226 Difference]: Without dead ends: 32194 [2019-11-23 22:50:34,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-11-23 22:50:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 32066. [2019-11-23 22:50:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32066 states. [2019-11-23 22:50:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32066 states to 32066 states and 41178 transitions. [2019-11-23 22:50:35,902 INFO L78 Accepts]: Start accepts. Automaton has 32066 states and 41178 transitions. Word has length 90 [2019-11-23 22:50:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:35,903 INFO L462 AbstractCegarLoop]: Abstraction has 32066 states and 41178 transitions. [2019-11-23 22:50:35,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32066 states and 41178 transitions. [2019-11-23 22:50:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:50:36,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:36,043 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:36,043 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1352583657, now seen corresponding path program 1 times [2019-11-23 22:50:36,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:36,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088691510] [2019-11-23 22:50:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:36,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088691510] [2019-11-23 22:50:36,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:36,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:36,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511790064] [2019-11-23 22:50:36,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:36,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:36,088 INFO L87 Difference]: Start difference. First operand 32066 states and 41178 transitions. Second operand 3 states. [2019-11-23 22:50:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:38,084 INFO L93 Difference]: Finished difference Result 95594 states and 122647 transitions. [2019-11-23 22:50:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-23 22:50:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:38,164 INFO L225 Difference]: With dead ends: 95594 [2019-11-23 22:50:38,165 INFO L226 Difference]: Without dead ends: 63668 [2019-11-23 22:50:38,194 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 22:50:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63668 states. [2019-11-23 22:50:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63668 to 63668. [2019-11-23 22:50:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63668 states. [2019-11-23 22:50:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63668 states to 63668 states and 81494 transitions. [2019-11-23 22:50:40,463 INFO L78 Accepts]: Start accepts. Automaton has 63668 states and 81494 transitions. Word has length 111 [2019-11-23 22:50:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:40,463 INFO L462 AbstractCegarLoop]: Abstraction has 63668 states and 81494 transitions. [2019-11-23 22:50:40,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63668 states and 81494 transitions. [2019-11-23 22:50:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:50:40,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:40,488 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:40,488 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 734407375, now seen corresponding path program 1 times [2019-11-23 22:50:40,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:40,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289167424] [2019-11-23 22:50:40,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 22:50:40,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289167424] [2019-11-23 22:50:40,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:40,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:40,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545232001] [2019-11-23 22:50:40,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:40,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:40,552 INFO L87 Difference]: Start difference. First operand 63668 states and 81494 transitions. Second operand 3 states. [2019-11-23 22:50:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:43,786 INFO L93 Difference]: Finished difference Result 155852 states and 199384 transitions. [2019-11-23 22:50:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:43,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:50:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:43,864 INFO L225 Difference]: With dead ends: 155852 [2019-11-23 22:50:43,864 INFO L226 Difference]: Without dead ends: 92306 [2019-11-23 22:50:43,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92306 states. [2019-11-23 22:50:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92306 to 92048. [2019-11-23 22:50:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92048 states. [2019-11-23 22:50:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92048 states to 92048 states and 117198 transitions. [2019-11-23 22:50:46,236 INFO L78 Accepts]: Start accepts. Automaton has 92048 states and 117198 transitions. Word has length 152 [2019-11-23 22:50:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:46,236 INFO L462 AbstractCegarLoop]: Abstraction has 92048 states and 117198 transitions. [2019-11-23 22:50:46,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92048 states and 117198 transitions. [2019-11-23 22:50:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:50:46,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:46,271 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:46,271 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1781759337, now seen corresponding path program 1 times [2019-11-23 22:50:46,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:46,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975824259] [2019-11-23 22:50:46,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 22:50:46,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975824259] [2019-11-23 22:50:46,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:46,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:46,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045264731] [2019-11-23 22:50:46,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:46,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:46,325 INFO L87 Difference]: Start difference. First operand 92048 states and 117198 transitions. Second operand 3 states. [2019-11-23 22:50:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:50,477 INFO L93 Difference]: Finished difference Result 225404 states and 286908 transitions. [2019-11-23 22:50:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:50,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:50:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:50,593 INFO L225 Difference]: With dead ends: 225404 [2019-11-23 22:50:50,594 INFO L226 Difference]: Without dead ends: 133502 [2019-11-23 22:50:50,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:50:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133502 states. [2019-11-23 22:50:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133502 to 133116. [2019-11-23 22:50:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133116 states. [2019-11-23 22:50:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133116 states to 133116 states and 168662 transitions. [2019-11-23 22:50:56,437 INFO L78 Accepts]: Start accepts. Automaton has 133116 states and 168662 transitions. Word has length 152 [2019-11-23 22:50:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:56,437 INFO L462 AbstractCegarLoop]: Abstraction has 133116 states and 168662 transitions. [2019-11-23 22:50:56,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 133116 states and 168662 transitions. [2019-11-23 22:50:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:50:56,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:56,476 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:50:56,476 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 66864795, now seen corresponding path program 1 times [2019-11-23 22:50:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:56,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593747651] [2019-11-23 22:50:56,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:50:56,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593747651] [2019-11-23 22:50:56,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:56,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:56,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45252613] [2019-11-23 22:50:56,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:56,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:56,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:56,537 INFO L87 Difference]: Start difference. First operand 133116 states and 168662 transitions. Second operand 3 states. [2019-11-23 22:51:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:02,022 INFO L93 Difference]: Finished difference Result 325972 states and 412968 transitions. [2019-11-23 22:51:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:02,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:51:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:02,198 INFO L225 Difference]: With dead ends: 325972 [2019-11-23 22:51:02,199 INFO L226 Difference]: Without dead ends: 193026 [2019-11-23 22:51:02,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:51:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193026 states. [2019-11-23 22:51:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193026 to 192448. [2019-11-23 22:51:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192448 states. [2019-11-23 22:51:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192448 states to 192448 states and 242726 transitions. [2019-11-23 22:51:10,532 INFO L78 Accepts]: Start accepts. Automaton has 192448 states and 242726 transitions. Word has length 152 [2019-11-23 22:51:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:10,532 INFO L462 AbstractCegarLoop]: Abstraction has 192448 states and 242726 transitions. [2019-11-23 22:51:10,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 192448 states and 242726 transitions. [2019-11-23 22:51:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:51:10,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:10,599 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:51:10,600 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1013280947, now seen corresponding path program 1 times [2019-11-23 22:51:10,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:10,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149331148] [2019-11-23 22:51:10,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:51:10,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149331148] [2019-11-23 22:51:10,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:10,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:51:10,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650427824] [2019-11-23 22:51:10,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:10,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:10,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:10,652 INFO L87 Difference]: Start difference. First operand 192448 states and 242726 transitions. Second operand 3 states. [2019-11-23 22:51:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:19,776 INFO L93 Difference]: Finished difference Result 470804 states and 593244 transitions. [2019-11-23 22:51:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:19,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:51:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:20,020 INFO L225 Difference]: With dead ends: 470804 [2019-11-23 22:51:20,020 INFO L226 Difference]: Without dead ends: 278450 [2019-11-23 22:51:20,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:51:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278450 states. [2019-11-23 22:51:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278450 to 277584. [2019-11-23 22:51:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277584 states. [2019-11-23 22:51:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277584 states to 277584 states and 348030 transitions. [2019-11-23 22:51:32,402 INFO L78 Accepts]: Start accepts. Automaton has 277584 states and 348030 transitions. Word has length 152 [2019-11-23 22:51:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:32,402 INFO L462 AbstractCegarLoop]: Abstraction has 277584 states and 348030 transitions. [2019-11-23 22:51:32,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 277584 states and 348030 transitions. [2019-11-23 22:51:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:51:32,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:32,464 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:51:32,464 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 371466903, now seen corresponding path program 1 times [2019-11-23 22:51:32,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:32,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753751348] [2019-11-23 22:51:32,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:51:32,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753751348] [2019-11-23 22:51:32,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:32,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:51:32,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417269667] [2019-11-23 22:51:32,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:51:32,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:32,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:51:32,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:51:32,538 INFO L87 Difference]: Start difference. First operand 277584 states and 348030 transitions. Second operand 5 states.