/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/token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:49:19,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:49:19,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:49:19,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:49:19,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:49:19,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:49:19,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:49:19,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:49:19,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:49:19,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:49:19,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:49:19,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:49:19,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:49:19,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:49:19,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:49:19,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:49:19,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:49:19,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:49:19,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:49:19,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:49:19,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:49:19,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:49:19,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:49:19,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:49:19,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:49:19,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:49:19,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:49:19,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:49:19,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:49:19,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:49:19,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:49:19,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:49:19,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:49:19,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:49:19,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:49:19,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:49:19,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:49:19,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:49:19,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:49:19,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:49:19,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:49:19,454 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:49:19,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:49:19,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:49:19,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:49:19,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:49:19,470 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:49:19,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:49:19,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:49:19,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:49:19,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:49:19,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:49:19,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:49:19,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:49:19,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:49:19,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:49:19,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:49:19,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:49:19,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:49:19,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:49:19,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:49:19,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:49:19,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:49:19,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:49:19,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:49:19,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:49:19,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:49:19,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:49:19,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:49:19,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:49:19,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:49:19,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:49:19,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:49:19,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:49:19,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:49:19,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:49:19,789 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:49:19,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-11-23 22:49:19,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8a65208/9214a9816f5241788c481b5687da8b50/FLAGa32c25079 [2019-11-23 22:49:20,358 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:49:20,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-11-23 22:49:20,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8a65208/9214a9816f5241788c481b5687da8b50/FLAGa32c25079 [2019-11-23 22:49:20,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8a65208/9214a9816f5241788c481b5687da8b50 [2019-11-23 22:49:20,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:49:20,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:49:20,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:20,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:49:20,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:49:20,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:20" (1/1) ... [2019-11-23 22:49:20,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcfe516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:20, skipping insertion in model container [2019-11-23 22:49:20,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:20" (1/1) ... [2019-11-23 22:49:20,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:49:20,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:49:21,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:21,052 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:49:21,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:21,229 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:49:21,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21 WrapperNode [2019-11-23 22:49:21,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:21,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:21,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:49:21,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:49:21,240 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:49:21" (1/1) ... [2019-11-23 22:49:21,258 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:49:21" (1/1) ... [2019-11-23 22:49:21,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:21,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:49:21,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:49:21,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:49:21,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (1/1) ... [2019-11-23 22:49:21,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:49:21,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:49:21,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:49:21,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:49:21,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (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:49:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:49:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:49:23,270 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:49:23,271 INFO L284 CfgBuilder]: Removed 237 assume(true) statements. [2019-11-23 22:49:23,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:23 BoogieIcfgContainer [2019-11-23 22:49:23,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:49:23,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:49:23,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:49:23,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:49:23,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:20" (1/3) ... [2019-11-23 22:49:23,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3466e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:23, skipping insertion in model container [2019-11-23 22:49:23,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:21" (2/3) ... [2019-11-23 22:49:23,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3466e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:23, skipping insertion in model container [2019-11-23 22:49:23,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:23" (3/3) ... [2019-11-23 22:49:23,283 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2019-11-23 22:49:23,292 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:49:23,302 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 22:49:23,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 22:49:23,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:49:23,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:49:23,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:49:23,364 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:49:23,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:49:23,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:49:23,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:49:23,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:49:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states. [2019-11-23 22:49:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:23,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:23,422 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, 1, 1, 1, 1] [2019-11-23 22:49:23,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1352099133, now seen corresponding path program 1 times [2019-11-23 22:49:23,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:23,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708253991] [2019-11-23 22:49:23,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:23,675 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:49:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708253991] [2019-11-23 22:49:23,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:23,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:23,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126298591] [2019-11-23 22:49:23,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:23,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:23,703 INFO L87 Difference]: Start difference. First operand 673 states. Second operand 3 states. [2019-11-23 22:49:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:23,815 INFO L93 Difference]: Finished difference Result 1341 states and 2065 transitions. [2019-11-23 22:49:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:23,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:23,838 INFO L225 Difference]: With dead ends: 1341 [2019-11-23 22:49:23,839 INFO L226 Difference]: Without dead ends: 669 [2019-11-23 22:49:23,846 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:49:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-11-23 22:49:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2019-11-23 22:49:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-23 22:49:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1011 transitions. [2019-11-23 22:49:23,943 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1011 transitions. Word has length 94 [2019-11-23 22:49:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:23,944 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1011 transitions. [2019-11-23 22:49:23,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1011 transitions. [2019-11-23 22:49:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:23,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:23,948 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, 1, 1, 1, 1] [2019-11-23 22:49:23,948 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -524964097, now seen corresponding path program 1 times [2019-11-23 22:49:23,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:23,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879387081] [2019-11-23 22:49:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,075 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:49:24,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879387081] [2019-11-23 22:49:24,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099701406] [2019-11-23 22:49:24,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:24,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:24,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:24,083 INFO L87 Difference]: Start difference. First operand 669 states and 1011 transitions. Second operand 3 states. [2019-11-23 22:49:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,180 INFO L93 Difference]: Finished difference Result 1859 states and 2801 transitions. [2019-11-23 22:49:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:24,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,190 INFO L225 Difference]: With dead ends: 1859 [2019-11-23 22:49:24,190 INFO L226 Difference]: Without dead ends: 1201 [2019-11-23 22:49:24,193 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:49:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-11-23 22:49:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1197. [2019-11-23 22:49:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1802 transitions. [2019-11-23 22:49:24,275 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1802 transitions. Word has length 94 [2019-11-23 22:49:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,275 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1802 transitions. [2019-11-23 22:49:24,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1802 transitions. [2019-11-23 22:49:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:24,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,283 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, 1, 1, 1, 1] [2019-11-23 22:49:24,283 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1381399163, now seen corresponding path program 1 times [2019-11-23 22:49:24,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050139076] [2019-11-23 22:49:24,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,396 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:49:24,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050139076] [2019-11-23 22:49:24,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:24,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299991961] [2019-11-23 22:49:24,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:24,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:24,399 INFO L87 Difference]: Start difference. First operand 1197 states and 1802 transitions. Second operand 3 states. [2019-11-23 22:49:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,456 INFO L93 Difference]: Finished difference Result 2382 states and 3585 transitions. [2019-11-23 22:49:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:24,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,464 INFO L225 Difference]: With dead ends: 2382 [2019-11-23 22:49:24,464 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:24,466 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:49:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1794 transitions. [2019-11-23 22:49:24,517 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1794 transitions. Word has length 94 [2019-11-23 22:49:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,518 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1794 transitions. [2019-11-23 22:49:24,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1794 transitions. [2019-11-23 22:49:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:24,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,527 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, 1, 1, 1, 1] [2019-11-23 22:49:24,528 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 334516095, now seen corresponding path program 1 times [2019-11-23 22:49:24,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739428688] [2019-11-23 22:49:24,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,632 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:49:24,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739428688] [2019-11-23 22:49:24,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:24,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893531975] [2019-11-23 22:49:24,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:24,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:24,635 INFO L87 Difference]: Start difference. First operand 1197 states and 1794 transitions. Second operand 3 states. [2019-11-23 22:49:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,691 INFO L93 Difference]: Finished difference Result 2380 states and 3566 transitions. [2019-11-23 22:49:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:24,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,697 INFO L225 Difference]: With dead ends: 2380 [2019-11-23 22:49:24,697 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:24,700 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:49:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1786 transitions. [2019-11-23 22:49:24,765 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1786 transitions. Word has length 94 [2019-11-23 22:49:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,765 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1786 transitions. [2019-11-23 22:49:24,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1786 transitions. [2019-11-23 22:49:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:24,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,767 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, 1, 1, 1, 1] [2019-11-23 22:49:24,767 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -582773373, now seen corresponding path program 1 times [2019-11-23 22:49:24,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412990815] [2019-11-23 22:49:24,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,828 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:49:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412990815] [2019-11-23 22:49:24,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:24,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383332044] [2019-11-23 22:49:24,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:24,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:24,832 INFO L87 Difference]: Start difference. First operand 1197 states and 1786 transitions. Second operand 3 states. [2019-11-23 22:49:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,890 INFO L93 Difference]: Finished difference Result 2379 states and 3549 transitions. [2019-11-23 22:49:24,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:24,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,897 INFO L225 Difference]: With dead ends: 2379 [2019-11-23 22:49:24,898 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:24,900 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:49:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1778 transitions. [2019-11-23 22:49:24,946 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1778 transitions. Word has length 94 [2019-11-23 22:49:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,947 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1778 transitions. [2019-11-23 22:49:24,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1778 transitions. [2019-11-23 22:49:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:24,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,948 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, 1, 1, 1, 1] [2019-11-23 22:49:24,948 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1859289345, now seen corresponding path program 1 times [2019-11-23 22:49:24,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218475747] [2019-11-23 22:49:24,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,010 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:49:25,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218475747] [2019-11-23 22:49:25,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:25,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967001789] [2019-11-23 22:49:25,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:25,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,014 INFO L87 Difference]: Start difference. First operand 1197 states and 1778 transitions. Second operand 3 states. [2019-11-23 22:49:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,077 INFO L93 Difference]: Finished difference Result 2378 states and 3532 transitions. [2019-11-23 22:49:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:25,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,084 INFO L225 Difference]: With dead ends: 2378 [2019-11-23 22:49:25,084 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:25,088 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:49:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1770 transitions. [2019-11-23 22:49:25,141 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1770 transitions. Word has length 94 [2019-11-23 22:49:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,142 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1770 transitions. [2019-11-23 22:49:25,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1770 transitions. [2019-11-23 22:49:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:25,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,143 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, 1, 1, 1, 1] [2019-11-23 22:49:25,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 870479363, now seen corresponding path program 1 times [2019-11-23 22:49:25,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516084945] [2019-11-23 22:49:25,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,237 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:49:25,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516084945] [2019-11-23 22:49:25,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013833044] [2019-11-23 22:49:25,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:25,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,248 INFO L87 Difference]: Start difference. First operand 1197 states and 1770 transitions. Second operand 3 states. [2019-11-23 22:49:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,336 INFO L93 Difference]: Finished difference Result 2377 states and 3515 transitions. [2019-11-23 22:49:25,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:25,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,344 INFO L225 Difference]: With dead ends: 2377 [2019-11-23 22:49:25,344 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:25,347 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:49:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1762 transitions. [2019-11-23 22:49:25,427 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1762 transitions. Word has length 94 [2019-11-23 22:49:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,427 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1762 transitions. [2019-11-23 22:49:25,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1762 transitions. [2019-11-23 22:49:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:25,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,430 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, 1, 1, 1, 1] [2019-11-23 22:49:25,430 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1709513025, now seen corresponding path program 1 times [2019-11-23 22:49:25,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072066582] [2019-11-23 22:49:25,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,478 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:49:25,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072066582] [2019-11-23 22:49:25,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:25,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128148648] [2019-11-23 22:49:25,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:25,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,481 INFO L87 Difference]: Start difference. First operand 1197 states and 1762 transitions. Second operand 3 states. [2019-11-23 22:49:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,619 INFO L93 Difference]: Finished difference Result 2376 states and 3498 transitions. [2019-11-23 22:49:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:25,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,628 INFO L225 Difference]: With dead ends: 2376 [2019-11-23 22:49:25,629 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:25,631 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:49:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1738 transitions. [2019-11-23 22:49:25,713 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1738 transitions. Word has length 94 [2019-11-23 22:49:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,714 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1738 transitions. [2019-11-23 22:49:25,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1738 transitions. [2019-11-23 22:49:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:25,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,716 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, 1, 1, 1, 1] [2019-11-23 22:49:25,716 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2135686843, now seen corresponding path program 1 times [2019-11-23 22:49:25,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529120527] [2019-11-23 22:49:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,772 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:49:25,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529120527] [2019-11-23 22:49:25,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:25,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709242440] [2019-11-23 22:49:25,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:25,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,780 INFO L87 Difference]: Start difference. First operand 1197 states and 1738 transitions. Second operand 3 states. [2019-11-23 22:49:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,881 INFO L93 Difference]: Finished difference Result 2375 states and 3449 transitions. [2019-11-23 22:49:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:25,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,888 INFO L225 Difference]: With dead ends: 2375 [2019-11-23 22:49:25,888 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:25,890 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:49:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1714 transitions. [2019-11-23 22:49:25,984 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1714 transitions. Word has length 94 [2019-11-23 22:49:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,984 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1714 transitions. [2019-11-23 22:49:25,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1714 transitions. [2019-11-23 22:49:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:25,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,986 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, 1, 1, 1, 1] [2019-11-23 22:49:25,986 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash -158776254, now seen corresponding path program 1 times [2019-11-23 22:49:25,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603848188] [2019-11-23 22:49:25,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,019 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:49:26,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603848188] [2019-11-23 22:49:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827211360] [2019-11-23 22:49:26,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,022 INFO L87 Difference]: Start difference. First operand 1197 states and 1714 transitions. Second operand 3 states. [2019-11-23 22:49:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,114 INFO L93 Difference]: Finished difference Result 2374 states and 3400 transitions. [2019-11-23 22:49:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,121 INFO L225 Difference]: With dead ends: 2374 [2019-11-23 22:49:26,122 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:26,124 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:49:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1690 transitions. [2019-11-23 22:49:26,185 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1690 transitions. Word has length 94 [2019-11-23 22:49:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,187 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1690 transitions. [2019-11-23 22:49:26,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1690 transitions. [2019-11-23 22:49:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:26,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,189 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, 1, 1, 1, 1] [2019-11-23 22:49:26,189 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash 126651783, now seen corresponding path program 1 times [2019-11-23 22:49:26,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123415215] [2019-11-23 22:49:26,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,220 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:49:26,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123415215] [2019-11-23 22:49:26,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451792889] [2019-11-23 22:49:26,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,222 INFO L87 Difference]: Start difference. First operand 1197 states and 1690 transitions. Second operand 3 states. [2019-11-23 22:49:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,310 INFO L93 Difference]: Finished difference Result 2372 states and 3349 transitions. [2019-11-23 22:49:26,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,317 INFO L225 Difference]: With dead ends: 2372 [2019-11-23 22:49:26,318 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:26,320 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:49:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1666 transitions. [2019-11-23 22:49:26,378 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1666 transitions. Word has length 94 [2019-11-23 22:49:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,379 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1666 transitions. [2019-11-23 22:49:26,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1666 transitions. [2019-11-23 22:49:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:26,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,380 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, 1, 1, 1, 1] [2019-11-23 22:49:26,381 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 48750924, now seen corresponding path program 1 times [2019-11-23 22:49:26,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924903462] [2019-11-23 22:49:26,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,410 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:49:26,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924903462] [2019-11-23 22:49:26,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613467614] [2019-11-23 22:49:26,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,413 INFO L87 Difference]: Start difference. First operand 1197 states and 1666 transitions. Second operand 3 states. [2019-11-23 22:49:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,527 INFO L93 Difference]: Finished difference Result 2371 states and 3300 transitions. [2019-11-23 22:49:26,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,534 INFO L225 Difference]: With dead ends: 2371 [2019-11-23 22:49:26,534 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:26,536 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:49:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1642 transitions. [2019-11-23 22:49:26,591 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1642 transitions. Word has length 94 [2019-11-23 22:49:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,591 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1642 transitions. [2019-11-23 22:49:26,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1642 transitions. [2019-11-23 22:49:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:26,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,592 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, 1, 1, 1, 1] [2019-11-23 22:49:26,593 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -895416632, now seen corresponding path program 1 times [2019-11-23 22:49:26,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464546819] [2019-11-23 22:49:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,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:49:26,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464546819] [2019-11-23 22:49:26,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279174590] [2019-11-23 22:49:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,636 INFO L87 Difference]: Start difference. First operand 1197 states and 1642 transitions. Second operand 3 states. [2019-11-23 22:49:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,727 INFO L93 Difference]: Finished difference Result 2370 states and 3251 transitions. [2019-11-23 22:49:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,733 INFO L225 Difference]: With dead ends: 2370 [2019-11-23 22:49:26,733 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:26,736 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:49:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1618 transitions. [2019-11-23 22:49:26,793 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1618 transitions. Word has length 94 [2019-11-23 22:49:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,793 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1618 transitions. [2019-11-23 22:49:26,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1618 transitions. [2019-11-23 22:49:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:26,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,794 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, 1, 1, 1, 1] [2019-11-23 22:49:26,795 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash -424221427, now seen corresponding path program 1 times [2019-11-23 22:49:26,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677489225] [2019-11-23 22:49:26,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,859 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:49:26,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677489225] [2019-11-23 22:49:26,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881716271] [2019-11-23 22:49:26,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,862 INFO L87 Difference]: Start difference. First operand 1197 states and 1618 transitions. Second operand 3 states. [2019-11-23 22:49:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,928 INFO L93 Difference]: Finished difference Result 2381 states and 3216 transitions. [2019-11-23 22:49:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,937 INFO L225 Difference]: With dead ends: 2381 [2019-11-23 22:49:26,937 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:26,940 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:49:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1610 transitions. [2019-11-23 22:49:26,999 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1610 transitions. Word has length 94 [2019-11-23 22:49:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:27,001 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1610 transitions. [2019-11-23 22:49:27,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1610 transitions. [2019-11-23 22:49:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:27,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:27,002 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, 1, 1, 1, 1] [2019-11-23 22:49:27,003 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -362181813, now seen corresponding path program 1 times [2019-11-23 22:49:27,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:27,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850852089] [2019-11-23 22:49:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:27,053 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:49:27,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850852089] [2019-11-23 22:49:27,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:27,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:27,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491208430] [2019-11-23 22:49:27,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:27,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:27,056 INFO L87 Difference]: Start difference. First operand 1197 states and 1610 transitions. Second operand 3 states. [2019-11-23 22:49:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:27,163 INFO L93 Difference]: Finished difference Result 2373 states and 3192 transitions. [2019-11-23 22:49:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:27,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:27,169 INFO L225 Difference]: With dead ends: 2373 [2019-11-23 22:49:27,169 INFO L226 Difference]: Without dead ends: 1197 [2019-11-23 22:49:27,173 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:49:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-23 22:49:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-23 22:49:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-23 22:49:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1586 transitions. [2019-11-23 22:49:27,234 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1586 transitions. Word has length 94 [2019-11-23 22:49:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:27,234 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1586 transitions. [2019-11-23 22:49:27,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1586 transitions. [2019-11-23 22:49:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:49:27,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:27,235 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, 1, 1, 1, 1] [2019-11-23 22:49:27,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1938640777, now seen corresponding path program 1 times [2019-11-23 22:49:27,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:27,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646799088] [2019-11-23 22:49:27,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:27,287 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:49:27,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646799088] [2019-11-23 22:49:27,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:27,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:27,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820403805] [2019-11-23 22:49:27,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:27,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:27,291 INFO L87 Difference]: Start difference. First operand 1197 states and 1586 transitions. Second operand 3 states. [2019-11-23 22:49:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:27,412 INFO L93 Difference]: Finished difference Result 3442 states and 4568 transitions. [2019-11-23 22:49:27,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:27,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:49:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:27,423 INFO L225 Difference]: With dead ends: 3442 [2019-11-23 22:49:27,423 INFO L226 Difference]: Without dead ends: 2271 [2019-11-23 22:49:27,425 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:49:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-11-23 22:49:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2177. [2019-11-23 22:49:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2177 states. [2019-11-23 22:49:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 2873 transitions. [2019-11-23 22:49:27,520 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 2873 transitions. Word has length 94 [2019-11-23 22:49:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:27,520 INFO L462 AbstractCegarLoop]: Abstraction has 2177 states and 2873 transitions. [2019-11-23 22:49:27,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2873 transitions. [2019-11-23 22:49:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:27,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:27,524 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:27,524 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1053785170, now seen corresponding path program 1 times [2019-11-23 22:49:27,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:27,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108135779] [2019-11-23 22:49:27,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:27,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108135779] [2019-11-23 22:49:27,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:27,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:27,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576964888] [2019-11-23 22:49:27,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:27,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:27,595 INFO L87 Difference]: Start difference. First operand 2177 states and 2873 transitions. Second operand 5 states. [2019-11-23 22:49:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:27,891 INFO L93 Difference]: Finished difference Result 4850 states and 6451 transitions. [2019-11-23 22:49:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:27,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:27,903 INFO L225 Difference]: With dead ends: 4850 [2019-11-23 22:49:27,904 INFO L226 Difference]: Without dead ends: 2703 [2019-11-23 22:49:27,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-11-23 22:49:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2183. [2019-11-23 22:49:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-11-23 22:49:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2848 transitions. [2019-11-23 22:49:28,079 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2848 transitions. Word has length 153 [2019-11-23 22:49:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:28,080 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2848 transitions. [2019-11-23 22:49:28,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2848 transitions. [2019-11-23 22:49:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:28,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:28,084 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:28,084 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash -66072534, now seen corresponding path program 1 times [2019-11-23 22:49:28,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:28,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277956606] [2019-11-23 22:49:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:28,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277956606] [2019-11-23 22:49:28,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:28,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:28,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422445090] [2019-11-23 22:49:28,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:28,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:28,191 INFO L87 Difference]: Start difference. First operand 2183 states and 2848 transitions. Second operand 3 states. [2019-11-23 22:49:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:28,482 INFO L93 Difference]: Finished difference Result 6364 states and 8326 transitions. [2019-11-23 22:49:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:28,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:49:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:28,500 INFO L225 Difference]: With dead ends: 6364 [2019-11-23 22:49:28,501 INFO L226 Difference]: Without dead ends: 4213 [2019-11-23 22:49:28,504 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:49:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-11-23 22:49:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4041. [2019-11-23 22:49:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4041 states. [2019-11-23 22:49:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5266 transitions. [2019-11-23 22:49:28,726 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5266 transitions. Word has length 153 [2019-11-23 22:49:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:28,726 INFO L462 AbstractCegarLoop]: Abstraction has 4041 states and 5266 transitions. [2019-11-23 22:49:28,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5266 transitions. [2019-11-23 22:49:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:28,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:28,730 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:28,731 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash 36728713, now seen corresponding path program 1 times [2019-11-23 22:49:28,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:28,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689571035] [2019-11-23 22:49:28,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:28,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689571035] [2019-11-23 22:49:28,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:28,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:28,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300421581] [2019-11-23 22:49:28,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:28,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:28,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:28,793 INFO L87 Difference]: Start difference. First operand 4041 states and 5266 transitions. Second operand 5 states. [2019-11-23 22:49:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:29,168 INFO L93 Difference]: Finished difference Result 8664 states and 11335 transitions. [2019-11-23 22:49:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:29,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:29,197 INFO L225 Difference]: With dead ends: 8664 [2019-11-23 22:49:29,197 INFO L226 Difference]: Without dead ends: 4659 [2019-11-23 22:49:29,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2019-11-23 22:49:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4047. [2019-11-23 22:49:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-11-23 22:49:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5213 transitions. [2019-11-23 22:49:29,401 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5213 transitions. Word has length 153 [2019-11-23 22:49:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:29,401 INFO L462 AbstractCegarLoop]: Abstraction has 4047 states and 5213 transitions. [2019-11-23 22:49:29,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5213 transitions. [2019-11-23 22:49:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:29,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:29,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:29,405 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2008140037, now seen corresponding path program 1 times [2019-11-23 22:49:29,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:29,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280337070] [2019-11-23 22:49:29,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:29,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280337070] [2019-11-23 22:49:29,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:29,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:29,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726223550] [2019-11-23 22:49:29,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:29,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:29,475 INFO L87 Difference]: Start difference. First operand 4047 states and 5213 transitions. Second operand 5 states. [2019-11-23 22:49:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:29,966 INFO L93 Difference]: Finished difference Result 9489 states and 12239 transitions. [2019-11-23 22:49:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:29,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:29,977 INFO L225 Difference]: With dead ends: 9489 [2019-11-23 22:49:29,977 INFO L226 Difference]: Without dead ends: 5485 [2019-11-23 22:49:29,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2019-11-23 22:49:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 4059. [2019-11-23 22:49:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4059 states. [2019-11-23 22:49:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 5168 transitions. [2019-11-23 22:49:30,186 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 5168 transitions. Word has length 153 [2019-11-23 22:49:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:30,187 INFO L462 AbstractCegarLoop]: Abstraction has 4059 states and 5168 transitions. [2019-11-23 22:49:30,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 5168 transitions. [2019-11-23 22:49:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:30,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:30,193 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:30,193 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash 430108545, now seen corresponding path program 1 times [2019-11-23 22:49:30,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:30,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016870841] [2019-11-23 22:49:30,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:30,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016870841] [2019-11-23 22:49:30,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:30,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:30,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091563633] [2019-11-23 22:49:30,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:30,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:30,283 INFO L87 Difference]: Start difference. First operand 4059 states and 5168 transitions. Second operand 5 states. [2019-11-23 22:49:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:30,743 INFO L93 Difference]: Finished difference Result 10858 states and 13911 transitions. [2019-11-23 22:49:30,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:30,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:30,760 INFO L225 Difference]: With dead ends: 10858 [2019-11-23 22:49:30,760 INFO L226 Difference]: Without dead ends: 6849 [2019-11-23 22:49:30,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6849 states. [2019-11-23 22:49:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6849 to 4083. [2019-11-23 22:49:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4083 states. [2019-11-23 22:49:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5139 transitions. [2019-11-23 22:49:31,022 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5139 transitions. Word has length 153 [2019-11-23 22:49:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:31,022 INFO L462 AbstractCegarLoop]: Abstraction has 4083 states and 5139 transitions. [2019-11-23 22:49:31,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5139 transitions. [2019-11-23 22:49:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:31,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:31,026 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:31,026 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -599250753, now seen corresponding path program 1 times [2019-11-23 22:49:31,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:31,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001552547] [2019-11-23 22:49:31,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:31,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001552547] [2019-11-23 22:49:31,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:31,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:31,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634015939] [2019-11-23 22:49:31,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:31,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:31,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:31,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:31,087 INFO L87 Difference]: Start difference. First operand 4083 states and 5139 transitions. Second operand 5 states. [2019-11-23 22:49:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:31,805 INFO L93 Difference]: Finished difference Result 11203 states and 14189 transitions. [2019-11-23 22:49:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:31,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:31,818 INFO L225 Difference]: With dead ends: 11203 [2019-11-23 22:49:31,819 INFO L226 Difference]: Without dead ends: 7177 [2019-11-23 22:49:31,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2019-11-23 22:49:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 4107. [2019-11-23 22:49:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4107 states. [2019-11-23 22:49:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 5110 transitions. [2019-11-23 22:49:32,058 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 5110 transitions. Word has length 153 [2019-11-23 22:49:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:32,058 INFO L462 AbstractCegarLoop]: Abstraction has 4107 states and 5110 transitions. [2019-11-23 22:49:32,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5110 transitions. [2019-11-23 22:49:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:32,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:32,062 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:32,062 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1573005627, now seen corresponding path program 1 times [2019-11-23 22:49:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159056558] [2019-11-23 22:49:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:32,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159056558] [2019-11-23 22:49:32,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:32,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763424556] [2019-11-23 22:49:32,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:32,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:32,118 INFO L87 Difference]: Start difference. First operand 4107 states and 5110 transitions. Second operand 5 states. [2019-11-23 22:49:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:32,695 INFO L93 Difference]: Finished difference Result 11548 states and 14467 transitions. [2019-11-23 22:49:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:32,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:32,706 INFO L225 Difference]: With dead ends: 11548 [2019-11-23 22:49:32,707 INFO L226 Difference]: Without dead ends: 7505 [2019-11-23 22:49:32,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-11-23 22:49:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 4131. [2019-11-23 22:49:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-11-23 22:49:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 5081 transitions. [2019-11-23 22:49:32,940 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 5081 transitions. Word has length 153 [2019-11-23 22:49:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:32,940 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 5081 transitions. [2019-11-23 22:49:32,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 5081 transitions. [2019-11-23 22:49:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:32,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:32,944 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:32,944 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash 16070327, now seen corresponding path program 1 times [2019-11-23 22:49:32,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:32,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73189414] [2019-11-23 22:49:32,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:33,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73189414] [2019-11-23 22:49:33,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:33,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:33,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975020854] [2019-11-23 22:49:33,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:33,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:33,004 INFO L87 Difference]: Start difference. First operand 4131 states and 5081 transitions. Second operand 5 states. [2019-11-23 22:49:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:33,567 INFO L93 Difference]: Finished difference Result 11893 states and 14745 transitions. [2019-11-23 22:49:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:33,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-23 22:49:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:33,581 INFO L225 Difference]: With dead ends: 11893 [2019-11-23 22:49:33,581 INFO L226 Difference]: Without dead ends: 7833 [2019-11-23 22:49:33,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2019-11-23 22:49:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 4155. [2019-11-23 22:49:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4155 states. [2019-11-23 22:49:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5052 transitions. [2019-11-23 22:49:33,955 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5052 transitions. Word has length 153 [2019-11-23 22:49:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:33,956 INFO L462 AbstractCegarLoop]: Abstraction has 4155 states and 5052 transitions. [2019-11-23 22:49:33,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5052 transitions. [2019-11-23 22:49:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:49:33,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:33,961 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:33,961 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1796271821, now seen corresponding path program 1 times [2019-11-23 22:49:33,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:33,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486619385] [2019-11-23 22:49:33,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:34,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486619385] [2019-11-23 22:49:34,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:34,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:34,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947131671] [2019-11-23 22:49:34,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:34,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:34,029 INFO L87 Difference]: Start difference. First operand 4155 states and 5052 transitions. Second operand 3 states. [2019-11-23 22:49:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:34,654 INFO L93 Difference]: Finished difference Result 11933 states and 14428 transitions. [2019-11-23 22:49:34,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:34,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:49:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:34,665 INFO L225 Difference]: With dead ends: 11933 [2019-11-23 22:49:34,665 INFO L226 Difference]: Without dead ends: 7863 [2019-11-23 22:49:34,670 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:49:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2019-11-23 22:49:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7859. [2019-11-23 22:49:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7859 states. [2019-11-23 22:49:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 9438 transitions. [2019-11-23 22:49:35,130 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 9438 transitions. Word has length 153 [2019-11-23 22:49:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:35,130 INFO L462 AbstractCegarLoop]: Abstraction has 7859 states and 9438 transitions. [2019-11-23 22:49:35,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 9438 transitions. [2019-11-23 22:49:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:49:35,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:35,135 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:35,135 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1292317504, now seen corresponding path program 1 times [2019-11-23 22:49:35,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:35,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666080317] [2019-11-23 22:49:35,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:35,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666080317] [2019-11-23 22:49:35,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:35,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101620130] [2019-11-23 22:49:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:35,197 INFO L87 Difference]: Start difference. First operand 7859 states and 9438 transitions. Second operand 3 states. [2019-11-23 22:49:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:36,199 INFO L93 Difference]: Finished difference Result 22478 states and 26930 transitions. [2019-11-23 22:49:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:36,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:49:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:36,215 INFO L225 Difference]: With dead ends: 22478 [2019-11-23 22:49:36,215 INFO L226 Difference]: Without dead ends: 14704 [2019-11-23 22:49:36,226 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:49:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14704 states. [2019-11-23 22:49:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14704 to 14700. [2019-11-23 22:49:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14700 states. [2019-11-23 22:49:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14700 states to 14700 states and 17546 transitions. [2019-11-23 22:49:36,999 INFO L78 Accepts]: Start accepts. Automaton has 14700 states and 17546 transitions. Word has length 154 [2019-11-23 22:49:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:37,000 INFO L462 AbstractCegarLoop]: Abstraction has 14700 states and 17546 transitions. [2019-11-23 22:49:37,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14700 states and 17546 transitions. [2019-11-23 22:49:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:49:37,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:37,008 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:37,008 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1678179906, now seen corresponding path program 1 times [2019-11-23 22:49:37,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:37,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615345156] [2019-11-23 22:49:37,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:37,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615345156] [2019-11-23 22:49:37,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:37,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:37,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115728148] [2019-11-23 22:49:37,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:37,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:37,039 INFO L87 Difference]: Start difference. First operand 14700 states and 17546 transitions. Second operand 3 states. [2019-11-23 22:49:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:38,398 INFO L93 Difference]: Finished difference Result 29236 states and 34908 transitions. [2019-11-23 22:49:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:38,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:49:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:38,409 INFO L225 Difference]: With dead ends: 29236 [2019-11-23 22:49:38,410 INFO L226 Difference]: Without dead ends: 14621 [2019-11-23 22:49:38,420 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:49:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14621 states. [2019-11-23 22:49:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14621 to 14621. [2019-11-23 22:49:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14621 states. [2019-11-23 22:49:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14621 states to 14621 states and 17457 transitions. [2019-11-23 22:49:39,187 INFO L78 Accepts]: Start accepts. Automaton has 14621 states and 17457 transitions. Word has length 154 [2019-11-23 22:49:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:39,188 INFO L462 AbstractCegarLoop]: Abstraction has 14621 states and 17457 transitions. [2019-11-23 22:49:39,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14621 states and 17457 transitions. [2019-11-23 22:49:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:49:39,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:39,195 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:39,195 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash 398099183, now seen corresponding path program 1 times [2019-11-23 22:49:39,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:39,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379968439] [2019-11-23 22:49:39,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:39,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379968439] [2019-11-23 22:49:39,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:39,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:39,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064503572] [2019-11-23 22:49:39,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:39,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:39,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:39,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:39,258 INFO L87 Difference]: Start difference. First operand 14621 states and 17457 transitions. Second operand 3 states. [2019-11-23 22:49:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:40,616 INFO L93 Difference]: Finished difference Result 41875 states and 49947 transitions. [2019-11-23 22:49:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:40,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 22:49:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:40,638 INFO L225 Difference]: With dead ends: 41875 [2019-11-23 22:49:40,638 INFO L226 Difference]: Without dead ends: 27339 [2019-11-23 22:49:40,646 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:49:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2019-11-23 22:49:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27335. [2019-11-23 22:49:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27335 states. [2019-11-23 22:49:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27335 states to 27335 states and 32527 transitions. [2019-11-23 22:49:42,007 INFO L78 Accepts]: Start accepts. Automaton has 27335 states and 32527 transitions. Word has length 155 [2019-11-23 22:49:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:42,008 INFO L462 AbstractCegarLoop]: Abstraction has 27335 states and 32527 transitions. [2019-11-23 22:49:42,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 27335 states and 32527 transitions. [2019-11-23 22:49:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:49:42,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:42,017 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:42,018 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash 783961585, now seen corresponding path program 1 times [2019-11-23 22:49:42,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:42,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393404443] [2019-11-23 22:49:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:42,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393404443] [2019-11-23 22:49:42,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:42,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:42,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219437645] [2019-11-23 22:49:42,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:42,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:42,045 INFO L87 Difference]: Start difference. First operand 27335 states and 32527 transitions. Second operand 3 states. [2019-11-23 22:49:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:43,930 INFO L93 Difference]: Finished difference Result 54507 states and 64873 transitions. [2019-11-23 22:49:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:43,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 22:49:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:43,952 INFO L225 Difference]: With dead ends: 54507 [2019-11-23 22:49:43,953 INFO L226 Difference]: Without dead ends: 27257 [2019-11-23 22:49:43,969 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:49:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27257 states. [2019-11-23 22:49:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27257 to 27257. [2019-11-23 22:49:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27257 states. [2019-11-23 22:49:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27257 states to 27257 states and 32440 transitions. [2019-11-23 22:49:45,274 INFO L78 Accepts]: Start accepts. Automaton has 27257 states and 32440 transitions. Word has length 155 [2019-11-23 22:49:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:45,274 INFO L462 AbstractCegarLoop]: Abstraction has 27257 states and 32440 transitions. [2019-11-23 22:49:45,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 27257 states and 32440 transitions. [2019-11-23 22:49:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:49:45,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:45,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:45,285 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1010140548, now seen corresponding path program 1 times [2019-11-23 22:49:45,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:45,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217563261] [2019-11-23 22:49:45,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217563261] [2019-11-23 22:49:45,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646879892] [2019-11-23 22:49:45,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:45,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:45,340 INFO L87 Difference]: Start difference. First operand 27257 states and 32440 transitions. Second operand 3 states. [2019-11-23 22:49:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:48,711 INFO L93 Difference]: Finished difference Result 77982 states and 92768 transitions. [2019-11-23 22:49:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:48,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:49:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:48,754 INFO L225 Difference]: With dead ends: 77982 [2019-11-23 22:49:48,754 INFO L226 Difference]: Without dead ends: 50810 [2019-11-23 22:49:48,771 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:49:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50810 states. [2019-11-23 22:49:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50810 to 50806. [2019-11-23 22:49:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50806 states. [2019-11-23 22:49:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50806 states to 50806 states and 60332 transitions. [2019-11-23 22:49:51,237 INFO L78 Accepts]: Start accepts. Automaton has 50806 states and 60332 transitions. Word has length 156 [2019-11-23 22:49:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:51,237 INFO L462 AbstractCegarLoop]: Abstraction has 50806 states and 60332 transitions. [2019-11-23 22:49:51,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 50806 states and 60332 transitions. [2019-11-23 22:49:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:49:51,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:51,250 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:51,250 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1396002950, now seen corresponding path program 1 times [2019-11-23 22:49:51,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:51,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295342905] [2019-11-23 22:49:51,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295342905] [2019-11-23 22:49:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890500013] [2019-11-23 22:49:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:51,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:51,289 INFO L87 Difference]: Start difference. First operand 50806 states and 60332 transitions. Second operand 3 states. [2019-11-23 22:49:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:53,782 INFO L93 Difference]: Finished difference Result 101450 states and 120486 transitions. [2019-11-23 22:49:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:53,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:49:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:53,827 INFO L225 Difference]: With dead ends: 101450 [2019-11-23 22:49:53,827 INFO L226 Difference]: Without dead ends: 50729 [2019-11-23 22:49:53,852 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:49:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50729 states. [2019-11-23 22:49:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50729 to 50729. [2019-11-23 22:49:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50729 states. [2019-11-23 22:49:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50729 states to 50729 states and 60247 transitions. [2019-11-23 22:49:57,792 INFO L78 Accepts]: Start accepts. Automaton has 50729 states and 60247 transitions. Word has length 156 [2019-11-23 22:49:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:57,792 INFO L462 AbstractCegarLoop]: Abstraction has 50729 states and 60247 transitions. [2019-11-23 22:49:57,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 50729 states and 60247 transitions. [2019-11-23 22:49:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:49:57,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:57,807 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:57,807 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 669473963, now seen corresponding path program 1 times [2019-11-23 22:49:57,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:57,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97869928] [2019-11-23 22:49:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:57,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97869928] [2019-11-23 22:49:57,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:57,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:57,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466395410] [2019-11-23 22:49:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:57,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:57,876 INFO L87 Difference]: Start difference. First operand 50729 states and 60247 transitions. Second operand 3 states. [2019-11-23 22:50:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:03,899 INFO L93 Difference]: Finished difference Result 144773 states and 171885 transitions. [2019-11-23 22:50:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:03,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:50:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:03,976 INFO L225 Difference]: With dead ends: 144773 [2019-11-23 22:50:03,976 INFO L226 Difference]: Without dead ends: 94129 [2019-11-23 22:50:03,999 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:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94129 states. [2019-11-23 22:50:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94129 to 94125. [2019-11-23 22:50:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94125 states. [2019-11-23 22:50:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94125 states to 94125 states and 111577 transitions. [2019-11-23 22:50:08,842 INFO L78 Accepts]: Start accepts. Automaton has 94125 states and 111577 transitions. Word has length 157 [2019-11-23 22:50:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:08,842 INFO L462 AbstractCegarLoop]: Abstraction has 94125 states and 111577 transitions. [2019-11-23 22:50:08,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 94125 states and 111577 transitions. [2019-11-23 22:50:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:50:08,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:08,864 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:08,864 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1055336365, now seen corresponding path program 1 times [2019-11-23 22:50:08,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:08,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797907013] [2019-11-23 22:50:08,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:50:08,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797907013] [2019-11-23 22:50:08,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:08,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339285533] [2019-11-23 22:50:08,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:08,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:08,897 INFO L87 Difference]: Start difference. First operand 94125 states and 111577 transitions. Second operand 3 states. [2019-11-23 22:50:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:14,133 INFO L93 Difference]: Finished difference Result 188089 states and 222979 transitions. [2019-11-23 22:50:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:14,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:50:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:14,214 INFO L225 Difference]: With dead ends: 188089 [2019-11-23 22:50:14,214 INFO L226 Difference]: Without dead ends: 94049 [2019-11-23 22:50:14,247 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:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94049 states. [2019-11-23 22:50:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94049 to 94049. [2019-11-23 22:50:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94049 states. [2019-11-23 22:50:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94049 states to 94049 states and 111494 transitions. [2019-11-23 22:50:21,491 INFO L78 Accepts]: Start accepts. Automaton has 94049 states and 111494 transitions. Word has length 157 [2019-11-23 22:50:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:21,492 INFO L462 AbstractCegarLoop]: Abstraction has 94049 states and 111494 transitions. [2019-11-23 22:50:21,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 94049 states and 111494 transitions. [2019-11-23 22:50:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:50:21,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:21,509 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:21,509 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -123170872, now seen corresponding path program 1 times [2019-11-23 22:50:21,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606102212] [2019-11-23 22:50:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:21,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606102212] [2019-11-23 22:50:21,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:21,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:21,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215749862] [2019-11-23 22:50:21,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:21,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:21,576 INFO L87 Difference]: Start difference. First operand 94049 states and 111494 transitions. Second operand 3 states. [2019-11-23 22:50:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,009 INFO L93 Difference]: Finished difference Result 267844 states and 317610 transitions. [2019-11-23 22:50:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:50:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,167 INFO L225 Difference]: With dead ends: 267844 [2019-11-23 22:50:31,167 INFO L226 Difference]: Without dead ends: 173880 [2019-11-23 22:50:31,221 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,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173880 states.