/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/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:35:29,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:35:29,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:35:29,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:35:29,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:35:29,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:35:29,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:35:29,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:35:29,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:35:29,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:35:29,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:35:29,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:35:29,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:35:29,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:35:29,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:35:29,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:35:29,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:35:29,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:35:29,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:35:29,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:35:29,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:35:29,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:35:29,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:35:29,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:35:29,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:35:29,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:35:29,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:35:29,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:35:29,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:35:29,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:35:29,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:35:29,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:35:29,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:35:29,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:35:29,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:35:29,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:35:29,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:35:29,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:35:29,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:35:29,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:35:29,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:35:29,557 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:35:29,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:35:29,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:35:29,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:35:29,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:35:29,572 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:35:29,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:35:29,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:35:29,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:35:29,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:35:29,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:35:29,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:35:29,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:35:29,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:35:29,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:35:29,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:35:29,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:35:29,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:35:29,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:35:29,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:35:29,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:35:29,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:35:29,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:35:29,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:29,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:35:29,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:35:29,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:35:29,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:35:29,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:35:29,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:35:29,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:35:29,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:35:29,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:35:29,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:35:29,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:35:29,887 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:35:29,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:29,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33677956/19845611fca8436fb66fbe0dbca820b8/FLAG129b477aa [2019-11-23 22:35:30,535 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:35:30,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:30,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33677956/19845611fca8436fb66fbe0dbca820b8/FLAG129b477aa [2019-11-23 22:35:30,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33677956/19845611fca8436fb66fbe0dbca820b8 [2019-11-23 22:35:30,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:35:30,811 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:35:30,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:30,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:35:30,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:35:30,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:30" (1/1) ... [2019-11-23 22:35:30,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e22e22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:30, skipping insertion in model container [2019-11-23 22:35:30,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:30" (1/1) ... [2019-11-23 22:35:30,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:35:30,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:35:31,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:31,442 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:35:31,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:31,627 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:35:31,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31 WrapperNode [2019-11-23 22:35:31,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:31,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:31,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:35:31,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:35:31,634 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:35:31" (1/1) ... [2019-11-23 22:35:31,651 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:35:31" (1/1) ... [2019-11-23 22:35:31,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:31,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:35:31,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:35:31,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:35:31,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (1/1) ... [2019-11-23 22:35:31,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:35:31,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:35:31,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:35:31,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:35:31,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (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:35:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:35:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:35:33,296 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:35:33,296 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:35:33,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:33 BoogieIcfgContainer [2019-11-23 22:35:33,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:35:33,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:35:33,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:35:33,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:35:33,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:30" (1/3) ... [2019-11-23 22:35:33,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be57814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:33, skipping insertion in model container [2019-11-23 22:35:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:31" (2/3) ... [2019-11-23 22:35:33,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be57814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:33, skipping insertion in model container [2019-11-23 22:35:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:33" (3/3) ... [2019-11-23 22:35:33,309 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:35:33,319 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:35:33,329 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:35:33,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:35:33,394 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:35:33,394 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:35:33,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:35:33,394 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:35:33,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:35:33,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:35:33,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:35:33,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:35:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-11-23 22:35:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:35:33,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:33,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:33,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 731422854, now seen corresponding path program 1 times [2019-11-23 22:35:33,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:33,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287740431] [2019-11-23 22:35:33,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:34,398 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:35:34,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287740431] [2019-11-23 22:35:34,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:34,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:34,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940709352] [2019-11-23 22:35:34,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:34,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:34,429 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 4 states. [2019-11-23 22:35:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:34,671 INFO L93 Difference]: Finished difference Result 944 states and 1672 transitions. [2019-11-23 22:35:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:34,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:35:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:34,706 INFO L225 Difference]: With dead ends: 944 [2019-11-23 22:35:34,706 INFO L226 Difference]: Without dead ends: 623 [2019-11-23 22:35:34,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-23 22:35:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 621. [2019-11-23 22:35:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-11-23 22:35:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 904 transitions. [2019-11-23 22:35:34,830 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 904 transitions. Word has length 150 [2019-11-23 22:35:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:34,831 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 904 transitions. [2019-11-23 22:35:34,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 904 transitions. [2019-11-23 22:35:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:35:34,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:34,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1954150630, now seen corresponding path program 1 times [2019-11-23 22:35:34,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:34,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579798242] [2019-11-23 22:35:34,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:34,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579798242] [2019-11-23 22:35:34,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:34,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:34,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136077692] [2019-11-23 22:35:34,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:34,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:34,956 INFO L87 Difference]: Start difference. First operand 621 states and 904 transitions. Second operand 3 states. [2019-11-23 22:35:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:35,020 INFO L93 Difference]: Finished difference Result 1825 states and 2650 transitions. [2019-11-23 22:35:35,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:35,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 22:35:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:35,028 INFO L225 Difference]: With dead ends: 1825 [2019-11-23 22:35:35,028 INFO L226 Difference]: Without dead ends: 1232 [2019-11-23 22:35:35,031 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:35:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-23 22:35:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 623. [2019-11-23 22:35:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-11-23 22:35:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 906 transitions. [2019-11-23 22:35:35,079 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 906 transitions. Word has length 151 [2019-11-23 22:35:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:35,079 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 906 transitions. [2019-11-23 22:35:35,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 906 transitions. [2019-11-23 22:35:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:35:35,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:35,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1787410567, now seen corresponding path program 1 times [2019-11-23 22:35:35,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:35,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479594737] [2019-11-23 22:35:35,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:35,327 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:35:35,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479594737] [2019-11-23 22:35:35,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:35,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:35,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950117957] [2019-11-23 22:35:35,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:35,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:35,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:35,334 INFO L87 Difference]: Start difference. First operand 623 states and 906 transitions. Second operand 4 states. [2019-11-23 22:35:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:35,400 INFO L93 Difference]: Finished difference Result 1236 states and 1798 transitions. [2019-11-23 22:35:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:35,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 22:35:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:35,404 INFO L225 Difference]: With dead ends: 1236 [2019-11-23 22:35:35,404 INFO L226 Difference]: Without dead ends: 621 [2019-11-23 22:35:35,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-11-23 22:35:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-11-23 22:35:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-11-23 22:35:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 902 transitions. [2019-11-23 22:35:35,441 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 902 transitions. Word has length 152 [2019-11-23 22:35:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:35,442 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 902 transitions. [2019-11-23 22:35:35,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 902 transitions. [2019-11-23 22:35:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:35:35,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:35,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,453 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 482775852, now seen corresponding path program 1 times [2019-11-23 22:35:35,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:35,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270140528] [2019-11-23 22:35:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:35,575 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:35:35,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270140528] [2019-11-23 22:35:35,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:35,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:35,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945990378] [2019-11-23 22:35:35,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:35,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:35,578 INFO L87 Difference]: Start difference. First operand 621 states and 902 transitions. Second operand 3 states. [2019-11-23 22:35:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:35,667 INFO L93 Difference]: Finished difference Result 1344 states and 1962 transitions. [2019-11-23 22:35:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:35,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:35:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:35,672 INFO L225 Difference]: With dead ends: 1344 [2019-11-23 22:35:35,672 INFO L226 Difference]: Without dead ends: 916 [2019-11-23 22:35:35,674 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:35:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-11-23 22:35:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 914. [2019-11-23 22:35:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-23 22:35:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1312 transitions. [2019-11-23 22:35:35,740 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1312 transitions. Word has length 152 [2019-11-23 22:35:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:35,742 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1312 transitions. [2019-11-23 22:35:35,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1312 transitions. [2019-11-23 22:35:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:35:35,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:35,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash -252971497, now seen corresponding path program 1 times [2019-11-23 22:35:35,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:35,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273882702] [2019-11-23 22:35:35,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:35,843 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:35:35,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273882702] [2019-11-23 22:35:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:35,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:35,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266927944] [2019-11-23 22:35:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:35,845 INFO L87 Difference]: Start difference. First operand 914 states and 1312 transitions. Second operand 3 states. [2019-11-23 22:35:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:35,939 INFO L93 Difference]: Finished difference Result 1868 states and 2763 transitions. [2019-11-23 22:35:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:35,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:35:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:35,945 INFO L225 Difference]: With dead ends: 1868 [2019-11-23 22:35:35,945 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 22:35:35,947 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:35:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 22:35:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1122. [2019-11-23 22:35:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-11-23 22:35:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1649 transitions. [2019-11-23 22:35:35,998 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1649 transitions. Word has length 153 [2019-11-23 22:35:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:35,999 INFO L462 AbstractCegarLoop]: Abstraction has 1122 states and 1649 transitions. [2019-11-23 22:35:35,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1649 transitions. [2019-11-23 22:35:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:35:36,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:36,002 INFO L82 PathProgramCache]: Analyzing trace with hash -414656171, now seen corresponding path program 1 times [2019-11-23 22:35:36,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:36,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191913807] [2019-11-23 22:35:36,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:36,210 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:35:36,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191913807] [2019-11-23 22:35:36,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:36,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:35:36,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658299303] [2019-11-23 22:35:36,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:36,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:36,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:36,212 INFO L87 Difference]: Start difference. First operand 1122 states and 1649 transitions. Second operand 8 states. [2019-11-23 22:35:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:37,620 INFO L93 Difference]: Finished difference Result 5092 states and 7948 transitions. [2019-11-23 22:35:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:35:37,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-11-23 22:35:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:37,642 INFO L225 Difference]: With dead ends: 5092 [2019-11-23 22:35:37,643 INFO L226 Difference]: Without dead ends: 4564 [2019-11-23 22:35:37,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:35:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-11-23 22:35:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 2438. [2019-11-23 22:35:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-11-23 22:35:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3666 transitions. [2019-11-23 22:35:37,800 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3666 transitions. Word has length 156 [2019-11-23 22:35:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:37,800 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 3666 transitions. [2019-11-23 22:35:37,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:35:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3666 transitions. [2019-11-23 22:35:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:35:37,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:37,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,804 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash -36834470, now seen corresponding path program 1 times [2019-11-23 22:35:37,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:37,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724336105] [2019-11-23 22:35:37,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:38,046 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:35:38,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724336105] [2019-11-23 22:35:38,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:38,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:35:38,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960871875] [2019-11-23 22:35:38,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:35:38,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:35:38,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:35:38,049 INFO L87 Difference]: Start difference. First operand 2438 states and 3666 transitions. Second operand 9 states. [2019-11-23 22:35:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:38,969 INFO L93 Difference]: Finished difference Result 4346 states and 6688 transitions. [2019-11-23 22:35:38,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:35:38,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-11-23 22:35:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:38,981 INFO L225 Difference]: With dead ends: 4346 [2019-11-23 22:35:38,981 INFO L226 Difference]: Without dead ends: 2261 [2019-11-23 22:35:38,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:35:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-11-23 22:35:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1329. [2019-11-23 22:35:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-11-23 22:35:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1944 transitions. [2019-11-23 22:35:39,081 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1944 transitions. Word has length 156 [2019-11-23 22:35:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:39,082 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 1944 transitions. [2019-11-23 22:35:39,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:35:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1944 transitions. [2019-11-23 22:35:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:35:39,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:39,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,085 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1259518371, now seen corresponding path program 1 times [2019-11-23 22:35:39,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:39,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702582970] [2019-11-23 22:35:39,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:39,251 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:35:39,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702582970] [2019-11-23 22:35:39,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:39,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:39,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088572148] [2019-11-23 22:35:39,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:39,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:39,253 INFO L87 Difference]: Start difference. First operand 1329 states and 1944 transitions. Second operand 4 states. [2019-11-23 22:35:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:39,521 INFO L93 Difference]: Finished difference Result 3436 states and 5032 transitions. [2019-11-23 22:35:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:39,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-23 22:35:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:39,531 INFO L225 Difference]: With dead ends: 3436 [2019-11-23 22:35:39,531 INFO L226 Difference]: Without dead ends: 2126 [2019-11-23 22:35:39,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-11-23 22:35:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2124. [2019-11-23 22:35:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-11-23 22:35:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 3088 transitions. [2019-11-23 22:35:39,693 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 3088 transitions. Word has length 156 [2019-11-23 22:35:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:39,693 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 3088 transitions. [2019-11-23 22:35:39,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 3088 transitions. [2019-11-23 22:35:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:35:39,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:39,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,697 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1304341371, now seen corresponding path program 1 times [2019-11-23 22:35:39,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:39,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412819508] [2019-11-23 22:35:39,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:39,775 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:35:39,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412819508] [2019-11-23 22:35:39,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:39,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:39,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996624589] [2019-11-23 22:35:39,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:39,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:39,778 INFO L87 Difference]: Start difference. First operand 2124 states and 3088 transitions. Second operand 3 states. [2019-11-23 22:35:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:40,060 INFO L93 Difference]: Finished difference Result 5735 states and 8430 transitions. [2019-11-23 22:35:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:40,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:35:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:40,078 INFO L225 Difference]: With dead ends: 5735 [2019-11-23 22:35:40,078 INFO L226 Difference]: Without dead ends: 3965 [2019-11-23 22:35:40,082 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:35:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2019-11-23 22:35:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3963. [2019-11-23 22:35:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3963 states. [2019-11-23 22:35:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5743 transitions. [2019-11-23 22:35:40,379 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5743 transitions. Word has length 158 [2019-11-23 22:35:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:40,379 INFO L462 AbstractCegarLoop]: Abstraction has 3963 states and 5743 transitions. [2019-11-23 22:35:40,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5743 transitions. [2019-11-23 22:35:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:35:40,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:40,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:40,384 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash -149125096, now seen corresponding path program 1 times [2019-11-23 22:35:40,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:40,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76251686] [2019-11-23 22:35:40,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:40,515 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:35:40,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76251686] [2019-11-23 22:35:40,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:40,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587497727] [2019-11-23 22:35:40,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:40,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:40,518 INFO L87 Difference]: Start difference. First operand 3963 states and 5743 transitions. Second operand 4 states. [2019-11-23 22:35:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:40,748 INFO L93 Difference]: Finished difference Result 6290 states and 9150 transitions. [2019-11-23 22:35:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:40,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 22:35:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:40,766 INFO L225 Difference]: With dead ends: 6290 [2019-11-23 22:35:40,767 INFO L226 Difference]: Without dead ends: 3205 [2019-11-23 22:35:40,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2019-11-23 22:35:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2019-11-23 22:35:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2019-11-23 22:35:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 4622 transitions. [2019-11-23 22:35:41,112 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 4622 transitions. Word has length 158 [2019-11-23 22:35:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:41,113 INFO L462 AbstractCegarLoop]: Abstraction has 3205 states and 4622 transitions. [2019-11-23 22:35:41,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 4622 transitions. [2019-11-23 22:35:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:35:41,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:41,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,118 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1489589689, now seen corresponding path program 1 times [2019-11-23 22:35:41,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:41,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566169055] [2019-11-23 22:35:41,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:41,305 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:35:41,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566169055] [2019-11-23 22:35:41,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:41,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:41,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102020469] [2019-11-23 22:35:41,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:41,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:41,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:41,308 INFO L87 Difference]: Start difference. First operand 3205 states and 4622 transitions. Second operand 4 states. [2019-11-23 22:35:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:41,949 INFO L93 Difference]: Finished difference Result 7582 states and 11284 transitions. [2019-11-23 22:35:41,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:41,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:35:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:41,995 INFO L225 Difference]: With dead ends: 7582 [2019-11-23 22:35:41,995 INFO L226 Difference]: Without dead ends: 5714 [2019-11-23 22:35:42,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2019-11-23 22:35:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5712. [2019-11-23 22:35:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2019-11-23 22:35:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 8330 transitions. [2019-11-23 22:35:42,490 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 8330 transitions. Word has length 162 [2019-11-23 22:35:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:42,490 INFO L462 AbstractCegarLoop]: Abstraction has 5712 states and 8330 transitions. [2019-11-23 22:35:42,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 8330 transitions. [2019-11-23 22:35:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:35:42,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:42,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:42,500 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1006634284, now seen corresponding path program 1 times [2019-11-23 22:35:42,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:42,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391330438] [2019-11-23 22:35:42,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:42,734 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:35:42,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391330438] [2019-11-23 22:35:42,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:42,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:42,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958682115] [2019-11-23 22:35:42,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:42,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:42,738 INFO L87 Difference]: Start difference. First operand 5712 states and 8330 transitions. Second operand 4 states. [2019-11-23 22:35:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:43,467 INFO L93 Difference]: Finished difference Result 16644 states and 24276 transitions. [2019-11-23 22:35:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:43,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:35:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:43,488 INFO L225 Difference]: With dead ends: 16644 [2019-11-23 22:35:43,489 INFO L226 Difference]: Without dead ends: 10971 [2019-11-23 22:35:43,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10971 states. [2019-11-23 22:35:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10971 to 10969. [2019-11-23 22:35:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10969 states. [2019-11-23 22:35:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10969 states to 10969 states and 15881 transitions. [2019-11-23 22:35:44,200 INFO L78 Accepts]: Start accepts. Automaton has 10969 states and 15881 transitions. Word has length 162 [2019-11-23 22:35:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:44,200 INFO L462 AbstractCegarLoop]: Abstraction has 10969 states and 15881 transitions. [2019-11-23 22:35:44,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 10969 states and 15881 transitions. [2019-11-23 22:35:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:35:44,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:44,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,210 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:44,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:44,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1638982146, now seen corresponding path program 1 times [2019-11-23 22:35:44,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:44,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953988998] [2019-11-23 22:35:44,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:44,263 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:35:44,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953988998] [2019-11-23 22:35:44,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:44,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:44,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625538240] [2019-11-23 22:35:44,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:44,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:44,265 INFO L87 Difference]: Start difference. First operand 10969 states and 15881 transitions. Second operand 3 states. [2019-11-23 22:35:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:45,465 INFO L93 Difference]: Finished difference Result 32713 states and 47392 transitions. [2019-11-23 22:35:45,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:45,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:35:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:45,516 INFO L225 Difference]: With dead ends: 32713 [2019-11-23 22:35:45,516 INFO L226 Difference]: Without dead ends: 21850 [2019-11-23 22:35:45,533 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:35:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21850 states. [2019-11-23 22:35:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21850 to 10975. [2019-11-23 22:35:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10975 states. [2019-11-23 22:35:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10975 states to 10975 states and 15887 transitions. [2019-11-23 22:35:46,431 INFO L78 Accepts]: Start accepts. Automaton has 10975 states and 15887 transitions. Word has length 163 [2019-11-23 22:35:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:46,431 INFO L462 AbstractCegarLoop]: Abstraction has 10975 states and 15887 transitions. [2019-11-23 22:35:46,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10975 states and 15887 transitions. [2019-11-23 22:35:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:46,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:46,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,441 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash -694477770, now seen corresponding path program 1 times [2019-11-23 22:35:46,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:46,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762628272] [2019-11-23 22:35:46,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:46,532 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:35:46,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762628272] [2019-11-23 22:35:46,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:46,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:46,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400293337] [2019-11-23 22:35:46,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:46,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:46,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:46,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:46,535 INFO L87 Difference]: Start difference. First operand 10975 states and 15887 transitions. Second operand 3 states. [2019-11-23 22:35:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:47,980 INFO L93 Difference]: Finished difference Result 31358 states and 45393 transitions. [2019-11-23 22:35:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:47,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 22:35:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:48,023 INFO L225 Difference]: With dead ends: 31358 [2019-11-23 22:35:48,023 INFO L226 Difference]: Without dead ends: 21138 [2019-11-23 22:35:48,037 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:35:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21138 states. [2019-11-23 22:35:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21138 to 21136. [2019-11-23 22:35:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21136 states. [2019-11-23 22:35:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21136 states to 21136 states and 30203 transitions. [2019-11-23 22:35:49,237 INFO L78 Accepts]: Start accepts. Automaton has 21136 states and 30203 transitions. Word has length 164 [2019-11-23 22:35:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:49,238 INFO L462 AbstractCegarLoop]: Abstraction has 21136 states and 30203 transitions. [2019-11-23 22:35:49,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 21136 states and 30203 transitions. [2019-11-23 22:35:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:49,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:49,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:49,251 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1370529197, now seen corresponding path program 1 times [2019-11-23 22:35:49,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:49,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922693557] [2019-11-23 22:35:49,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:49,480 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:35:49,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922693557] [2019-11-23 22:35:49,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:49,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:49,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629961403] [2019-11-23 22:35:49,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:49,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:49,483 INFO L87 Difference]: Start difference. First operand 21136 states and 30203 transitions. Second operand 4 states. [2019-11-23 22:35:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:50,581 INFO L93 Difference]: Finished difference Result 36717 states and 52561 transitions. [2019-11-23 22:35:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:50,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 22:35:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:50,602 INFO L225 Difference]: With dead ends: 36717 [2019-11-23 22:35:50,602 INFO L226 Difference]: Without dead ends: 16260 [2019-11-23 22:35:50,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16260 states. [2019-11-23 22:35:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16260 to 16260. [2019-11-23 22:35:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16260 states. [2019-11-23 22:35:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 23156 transitions. [2019-11-23 22:35:51,700 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 23156 transitions. Word has length 164 [2019-11-23 22:35:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:51,700 INFO L462 AbstractCegarLoop]: Abstraction has 16260 states and 23156 transitions. [2019-11-23 22:35:51,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 23156 transitions. [2019-11-23 22:35:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:35:51,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:51,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,711 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 707972396, now seen corresponding path program 1 times [2019-11-23 22:35:51,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:51,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615841840] [2019-11-23 22:35:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:51,781 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:35:51,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615841840] [2019-11-23 22:35:51,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:51,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:51,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488438715] [2019-11-23 22:35:51,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:51,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:51,784 INFO L87 Difference]: Start difference. First operand 16260 states and 23156 transitions. Second operand 3 states. [2019-11-23 22:35:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:53,092 INFO L93 Difference]: Finished difference Result 39385 states and 56970 transitions. [2019-11-23 22:35:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:53,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-23 22:35:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:53,117 INFO L225 Difference]: With dead ends: 39385 [2019-11-23 22:35:53,117 INFO L226 Difference]: Without dead ends: 25802 [2019-11-23 22:35:53,128 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:35:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25802 states. [2019-11-23 22:35:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25802 to 23502. [2019-11-23 22:35:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23502 states. [2019-11-23 22:35:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23502 states to 23502 states and 34348 transitions. [2019-11-23 22:35:55,077 INFO L78 Accepts]: Start accepts. Automaton has 23502 states and 34348 transitions. Word has length 166 [2019-11-23 22:35:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 23502 states and 34348 transitions. [2019-11-23 22:35:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23502 states and 34348 transitions. [2019-11-23 22:35:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 22:35:55,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:55,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,084 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:55,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1128583939, now seen corresponding path program 1 times [2019-11-23 22:35:55,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:55,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127730472] [2019-11-23 22:35:55,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:55,164 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:35:55,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127730472] [2019-11-23 22:35:55,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:55,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:55,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202889535] [2019-11-23 22:35:55,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:55,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:55,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:55,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:55,166 INFO L87 Difference]: Start difference. First operand 23502 states and 34348 transitions. Second operand 3 states. [2019-11-23 22:35:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:57,141 INFO L93 Difference]: Finished difference Result 57514 states and 85061 transitions. [2019-11-23 22:35:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:57,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-23 22:35:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:57,182 INFO L225 Difference]: With dead ends: 57514 [2019-11-23 22:35:57,182 INFO L226 Difference]: Without dead ends: 38094 [2019-11-23 22:35:57,199 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:35:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38094 states. [2019-11-23 22:35:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38094 to 35682. [2019-11-23 22:35:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35682 states. [2019-11-23 22:35:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35682 states to 35682 states and 52943 transitions. [2019-11-23 22:35:59,304 INFO L78 Accepts]: Start accepts. Automaton has 35682 states and 52943 transitions. Word has length 168 [2019-11-23 22:35:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:59,304 INFO L462 AbstractCegarLoop]: Abstraction has 35682 states and 52943 transitions. [2019-11-23 22:35:59,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35682 states and 52943 transitions. [2019-11-23 22:35:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-23 22:35:59,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:59,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:59,311 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:59,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1723219892, now seen corresponding path program 1 times [2019-11-23 22:35:59,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:59,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783149615] [2019-11-23 22:35:59,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:59,480 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:35:59,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783149615] [2019-11-23 22:35:59,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:59,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:59,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206458495] [2019-11-23 22:35:59,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:59,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:59,482 INFO L87 Difference]: Start difference. First operand 35682 states and 52943 transitions. Second operand 4 states. [2019-11-23 22:36:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:02,060 INFO L93 Difference]: Finished difference Result 68425 states and 101574 transitions. [2019-11-23 22:36:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:02,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-23 22:36:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:02,098 INFO L225 Difference]: With dead ends: 68425 [2019-11-23 22:36:02,099 INFO L226 Difference]: Without dead ends: 33020 [2019-11-23 22:36:02,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33020 states. [2019-11-23 22:36:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33020 to 32978. [2019-11-23 22:36:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32978 states. [2019-11-23 22:36:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32978 states to 32978 states and 48893 transitions. [2019-11-23 22:36:04,126 INFO L78 Accepts]: Start accepts. Automaton has 32978 states and 48893 transitions. Word has length 169 [2019-11-23 22:36:04,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:04,126 INFO L462 AbstractCegarLoop]: Abstraction has 32978 states and 48893 transitions. [2019-11-23 22:36:04,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32978 states and 48893 transitions. [2019-11-23 22:36:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 22:36:04,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:04,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,133 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1769186552, now seen corresponding path program 1 times [2019-11-23 22:36:04,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:04,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254677480] [2019-11-23 22:36:04,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:04,288 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:36:04,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254677480] [2019-11-23 22:36:04,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:04,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:04,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207631251] [2019-11-23 22:36:04,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:04,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:04,291 INFO L87 Difference]: Start difference. First operand 32978 states and 48893 transitions. Second operand 4 states. [2019-11-23 22:36:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:06,524 INFO L93 Difference]: Finished difference Result 65964 states and 97790 transitions. [2019-11-23 22:36:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:06,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-23 22:36:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:06,558 INFO L225 Difference]: With dead ends: 65964 [2019-11-23 22:36:06,558 INFO L226 Difference]: Without dead ends: 33143 [2019-11-23 22:36:06,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33143 states. [2019-11-23 22:36:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33143 to 33081. [2019-11-23 22:36:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33081 states. [2019-11-23 22:36:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33081 states to 33081 states and 48999 transitions. [2019-11-23 22:36:09,647 INFO L78 Accepts]: Start accepts. Automaton has 33081 states and 48999 transitions. Word has length 171 [2019-11-23 22:36:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 33081 states and 48999 transitions. [2019-11-23 22:36:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33081 states and 48999 transitions. [2019-11-23 22:36:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 22:36:09,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:09,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:09,654 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -165726760, now seen corresponding path program 1 times [2019-11-23 22:36:09,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:09,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740722810] [2019-11-23 22:36:09,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:09,709 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:36:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740722810] [2019-11-23 22:36:09,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:09,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:09,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791737331] [2019-11-23 22:36:09,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:09,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:09,711 INFO L87 Difference]: Start difference. First operand 33081 states and 48999 transitions. Second operand 3 states. [2019-11-23 22:36:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:13,313 INFO L93 Difference]: Finished difference Result 90155 states and 133677 transitions. [2019-11-23 22:36:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:13,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 22:36:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:13,386 INFO L225 Difference]: With dead ends: 90155 [2019-11-23 22:36:13,386 INFO L226 Difference]: Without dead ends: 65952 [2019-11-23 22:36:13,406 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:36:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65952 states. [2019-11-23 22:36:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65952 to 33091. [2019-11-23 22:36:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33091 states. [2019-11-23 22:36:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33091 states to 33091 states and 49009 transitions. [2019-11-23 22:36:15,823 INFO L78 Accepts]: Start accepts. Automaton has 33091 states and 49009 transitions. Word has length 172 [2019-11-23 22:36:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:15,823 INFO L462 AbstractCegarLoop]: Abstraction has 33091 states and 49009 transitions. [2019-11-23 22:36:15,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33091 states and 49009 transitions. [2019-11-23 22:36:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:36:15,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:15,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,830 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:15,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1362784471, now seen corresponding path program 1 times [2019-11-23 22:36:15,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:15,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718823693] [2019-11-23 22:36:15,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:15,938 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:36:15,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718823693] [2019-11-23 22:36:15,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:15,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:15,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696419764] [2019-11-23 22:36:15,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:15,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:15,940 INFO L87 Difference]: Start difference. First operand 33091 states and 49009 transitions. Second operand 4 states. [2019-11-23 22:36:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:18,361 INFO L93 Difference]: Finished difference Result 57736 states and 85419 transitions. [2019-11-23 22:36:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:18,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-23 22:36:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:18,399 INFO L225 Difference]: With dead ends: 57736 [2019-11-23 22:36:18,399 INFO L226 Difference]: Without dead ends: 33081 [2019-11-23 22:36:18,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33081 states. [2019-11-23 22:36:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33081 to 33081. [2019-11-23 22:36:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33081 states. [2019-11-23 22:36:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33081 states to 33081 states and 48994 transitions. [2019-11-23 22:36:21,561 INFO L78 Accepts]: Start accepts. Automaton has 33081 states and 48994 transitions. Word has length 173 [2019-11-23 22:36:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:21,561 INFO L462 AbstractCegarLoop]: Abstraction has 33081 states and 48994 transitions. [2019-11-23 22:36:21,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33081 states and 48994 transitions. [2019-11-23 22:36:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:36:21,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:21,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,568 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1128113098, now seen corresponding path program 1 times [2019-11-23 22:36:21,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:21,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808739186] [2019-11-23 22:36:21,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:21,735 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:36:21,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808739186] [2019-11-23 22:36:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:36:21,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048462481] [2019-11-23 22:36:21,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:36:21,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:36:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:21,737 INFO L87 Difference]: Start difference. First operand 33081 states and 48994 transitions. Second operand 5 states. [2019-11-23 22:36:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:24,229 INFO L93 Difference]: Finished difference Result 63182 states and 93572 transitions. [2019-11-23 22:36:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:24,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-11-23 22:36:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:24,267 INFO L225 Difference]: With dead ends: 63182 [2019-11-23 22:36:24,268 INFO L226 Difference]: Without dead ends: 30356 [2019-11-23 22:36:24,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30356 states. [2019-11-23 22:36:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30356 to 30199. [2019-11-23 22:36:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30199 states. [2019-11-23 22:36:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30199 states to 30199 states and 44670 transitions. [2019-11-23 22:36:26,329 INFO L78 Accepts]: Start accepts. Automaton has 30199 states and 44670 transitions. Word has length 173 [2019-11-23 22:36:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 30199 states and 44670 transitions. [2019-11-23 22:36:26,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:36:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30199 states and 44670 transitions. [2019-11-23 22:36:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 22:36:26,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:26,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,335 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash -268733951, now seen corresponding path program 1 times [2019-11-23 22:36:26,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:26,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963872765] [2019-11-23 22:36:26,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:26,627 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:36:26,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963872765] [2019-11-23 22:36:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:26,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:36:26,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736401398] [2019-11-23 22:36:26,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:36:26,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:36:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:36:26,640 INFO L87 Difference]: Start difference. First operand 30199 states and 44670 transitions. Second operand 9 states. [2019-11-23 22:36:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:39,649 INFO L93 Difference]: Finished difference Result 169822 states and 252167 transitions. [2019-11-23 22:36:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:36:39,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-11-23 22:36:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:39,815 INFO L225 Difference]: With dead ends: 169822 [2019-11-23 22:36:39,815 INFO L226 Difference]: Without dead ends: 141154 [2019-11-23 22:36:39,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:36:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141154 states. [2019-11-23 22:36:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141154 to 67002. [2019-11-23 22:36:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67002 states. [2019-11-23 22:36:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67002 states to 67002 states and 99040 transitions. [2019-11-23 22:36:45,433 INFO L78 Accepts]: Start accepts. Automaton has 67002 states and 99040 transitions. Word has length 176 [2019-11-23 22:36:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:45,433 INFO L462 AbstractCegarLoop]: Abstraction has 67002 states and 99040 transitions. [2019-11-23 22:36:45,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:36:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 67002 states and 99040 transitions. [2019-11-23 22:36:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 22:36:45,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:45,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,441 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 834846660, now seen corresponding path program 1 times [2019-11-23 22:36:45,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:45,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011085951] [2019-11-23 22:36:45,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:45,686 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:36:45,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011085951] [2019-11-23 22:36:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:45,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:36:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490118704] [2019-11-23 22:36:45,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:36:45,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:36:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:36:45,688 INFO L87 Difference]: Start difference. First operand 67002 states and 99040 transitions. Second operand 11 states.