/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/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:54,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:54,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:54,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:54,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:54,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:54,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:54,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:54,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:54,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:54,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:54,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:54,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:54,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:54,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:54,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:54,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:54,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:54,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:54,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:54,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:54,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:54,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:54,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:54,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:54,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:54,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:54,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:54,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:54,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:54,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:54,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:54,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:54,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:54,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:54,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:54,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:54,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:54,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:54,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:54,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:54,820 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:06:54,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:54,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:54,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:54,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:54,856 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:54,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:54,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:54,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:54,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:54,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:54,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:54,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:54,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:54,860 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:54,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:54,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:54,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:54,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:54,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:54,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:54,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:54,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:54,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:54,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:54,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:54,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:54,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:54,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:54,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:54,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:55,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:55,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:55,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:55,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:55,159 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:55,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-11-23 22:06:55,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8895ec055/ffe4d679e3c044fe97633f391182ec68/FLAGce6858d0f [2019-11-23 22:06:55,688 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:55,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-11-23 22:06:55,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8895ec055/ffe4d679e3c044fe97633f391182ec68/FLAGce6858d0f [2019-11-23 22:06:56,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8895ec055/ffe4d679e3c044fe97633f391182ec68 [2019-11-23 22:06:56,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:56,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:56,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:56,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:56,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:56,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d63343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56, skipping insertion in model container [2019-11-23 22:06:56,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:56,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:56,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:56,369 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:56,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:56,493 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:56,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56 WrapperNode [2019-11-23 22:06:56,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:56,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:56,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:56,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:56,502 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:06:56" (1/1) ... [2019-11-23 22:06:56,508 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:06:56" (1/1) ... [2019-11-23 22:06:56,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:56,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:56,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:56,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:56,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (1/1) ... [2019-11-23 22:06:56,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:56,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:56,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:56,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:56,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (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:06:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:56,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:56,940 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:56,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:56 BoogieIcfgContainer [2019-11-23 22:06:56,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:56,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:56,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:56,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:56,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:56" (1/3) ... [2019-11-23 22:06:56,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a13e8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:56, skipping insertion in model container [2019-11-23 22:06:56,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:56" (2/3) ... [2019-11-23 22:06:56,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a13e8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:56, skipping insertion in model container [2019-11-23 22:06:56,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:56" (3/3) ... [2019-11-23 22:06:56,949 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-11-23 22:06:56,958 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:56,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:56,983 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:57,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:57,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:57,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:57,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:57,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:57,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:57,007 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:57,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-23 22:06:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:57,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,027 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-11-23 22:06:57,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552796807] [2019-11-23 22:06:57,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552796807] [2019-11-23 22:06:57,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790777984] [2019-11-23 22:06:57,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,245 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-23 22:06:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,302 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-11-23 22:06:57,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,317 INFO L225 Difference]: With dead ends: 76 [2019-11-23 22:06:57,317 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 22:06:57,321 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:06:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 22:06:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-23 22:06:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 22:06:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-11-23 22:06:57,366 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-11-23 22:06:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-11-23 22:06:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-11-23 22:06:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:57,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,369 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-11-23 22:06:57,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360288230] [2019-11-23 22:06:57,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,424 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:06:57,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360288230] [2019-11-23 22:06:57,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350052944] [2019-11-23 22:06:57,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,428 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-11-23 22:06:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,469 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-11-23 22:06:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,471 INFO L225 Difference]: With dead ends: 103 [2019-11-23 22:06:57,471 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 22:06:57,472 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:06:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 22:06:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-23 22:06:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 22:06:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-11-23 22:06:57,481 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-11-23 22:06:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,481 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-11-23 22:06:57,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-11-23 22:06:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:57,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-11-23 22:06:57,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152301790] [2019-11-23 22:06:57,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,526 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:06:57,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152301790] [2019-11-23 22:06:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072016361] [2019-11-23 22:06:57,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,529 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-11-23 22:06:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,570 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-11-23 22:06:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,572 INFO L225 Difference]: With dead ends: 95 [2019-11-23 22:06:57,572 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 22:06:57,572 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:06:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 22:06:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-23 22:06:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-23 22:06:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-11-23 22:06:57,582 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-11-23 22:06:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,583 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-11-23 22:06:57,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-11-23 22:06:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:57,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,585 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-11-23 22:06:57,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721695077] [2019-11-23 22:06:57,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,651 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:06:57,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721695077] [2019-11-23 22:06:57,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809385626] [2019-11-23 22:06:57,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,655 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-11-23 22:06:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,683 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-23 22:06:57,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,688 INFO L225 Difference]: With dead ends: 120 [2019-11-23 22:06:57,688 INFO L226 Difference]: Without dead ends: 118 [2019-11-23 22:06:57,690 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:06:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-23 22:06:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-11-23 22:06:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 22:06:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-11-23 22:06:57,706 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-11-23 22:06:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,707 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-11-23 22:06:57,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-11-23 22:06:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:57,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,708 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-11-23 22:06:57,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613101571] [2019-11-23 22:06:57,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,768 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:06:57,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613101571] [2019-11-23 22:06:57,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678682033] [2019-11-23 22:06:57,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,770 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-11-23 22:06:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,793 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-11-23 22:06:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,795 INFO L225 Difference]: With dead ends: 200 [2019-11-23 22:06:57,795 INFO L226 Difference]: Without dead ends: 120 [2019-11-23 22:06:57,795 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:06:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-23 22:06:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-11-23 22:06:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-23 22:06:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-11-23 22:06:57,807 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-11-23 22:06:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,808 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-11-23 22:06:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-11-23 22:06:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:57,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-11-23 22:06:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320463755] [2019-11-23 22:06:57,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,847 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:06:57,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320463755] [2019-11-23 22:06:57,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001079733] [2019-11-23 22:06:57,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,851 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-11-23 22:06:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,875 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-11-23 22:06:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,877 INFO L225 Difference]: With dead ends: 179 [2019-11-23 22:06:57,877 INFO L226 Difference]: Without dead ends: 122 [2019-11-23 22:06:57,878 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:06:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-23 22:06:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-23 22:06:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-23 22:06:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-11-23 22:06:57,900 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-11-23 22:06:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,900 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-11-23 22:06:57,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-11-23 22:06:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:57,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-11-23 22:06:57,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70589013] [2019-11-23 22:06:57,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,974 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:06:57,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70589013] [2019-11-23 22:06:57,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562820495] [2019-11-23 22:06:57,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,977 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-11-23 22:06:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,007 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-11-23 22:06:58,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,009 INFO L225 Difference]: With dead ends: 344 [2019-11-23 22:06:58,010 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:06:58,011 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:06:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:06:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-11-23 22:06:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-23 22:06:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-11-23 22:06:58,026 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-11-23 22:06:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,027 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-11-23 22:06:58,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-11-23 22:06:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:58,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-11-23 22:06:58,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281764791] [2019-11-23 22:06:58,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,071 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:06:58,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281764791] [2019-11-23 22:06:58,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266559821] [2019-11-23 22:06:58,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,073 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-11-23 22:06:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,090 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-11-23 22:06:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,092 INFO L225 Difference]: With dead ends: 288 [2019-11-23 22:06:58,092 INFO L226 Difference]: Without dead ends: 286 [2019-11-23 22:06:58,093 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:06:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-23 22:06:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-11-23 22:06:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-23 22:06:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-11-23 22:06:58,105 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-11-23 22:06:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,106 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-11-23 22:06:58,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-11-23 22:06:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:58,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-11-23 22:06:58,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660268754] [2019-11-23 22:06:58,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,139 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:06:58,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660268754] [2019-11-23 22:06:58,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330022332] [2019-11-23 22:06:58,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,141 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-11-23 22:06:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,161 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-11-23 22:06:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,164 INFO L225 Difference]: With dead ends: 420 [2019-11-23 22:06:58,164 INFO L226 Difference]: Without dead ends: 418 [2019-11-23 22:06:58,165 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:06:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-23 22:06:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-11-23 22:06:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-23 22:06:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-11-23 22:06:58,182 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-11-23 22:06:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,182 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-11-23 22:06:58,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-11-23 22:06:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:58,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,190 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-11-23 22:06:58,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928498725] [2019-11-23 22:06:58,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,250 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:06:58,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928498725] [2019-11-23 22:06:58,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342471072] [2019-11-23 22:06:58,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,254 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-11-23 22:06:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,303 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-11-23 22:06:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,307 INFO L225 Difference]: With dead ends: 756 [2019-11-23 22:06:58,307 INFO L226 Difference]: Without dead ends: 442 [2019-11-23 22:06:58,309 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:06:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-23 22:06:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-23 22:06:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-23 22:06:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-11-23 22:06:58,343 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-11-23 22:06:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,350 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-11-23 22:06:58,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-11-23 22:06:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:58,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-11-23 22:06:58,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551895026] [2019-11-23 22:06:58,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,402 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:06:58,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551895026] [2019-11-23 22:06:58,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711630247] [2019-11-23 22:06:58,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,404 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-11-23 22:06:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,437 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-11-23 22:06:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,440 INFO L225 Difference]: With dead ends: 668 [2019-11-23 22:06:58,440 INFO L226 Difference]: Without dead ends: 454 [2019-11-23 22:06:58,441 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:06:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-23 22:06:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-11-23 22:06:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-23 22:06:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-11-23 22:06:58,458 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-11-23 22:06:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,458 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-11-23 22:06:58,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-11-23 22:06:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:58,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,460 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-11-23 22:06:58,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548517193] [2019-11-23 22:06:58,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,499 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:06:58,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548517193] [2019-11-23 22:06:58,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321483966] [2019-11-23 22:06:58,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,502 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-11-23 22:06:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,531 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-11-23 22:06:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,537 INFO L225 Difference]: With dead ends: 808 [2019-11-23 22:06:58,537 INFO L226 Difference]: Without dead ends: 806 [2019-11-23 22:06:58,539 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:06:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-11-23 22:06:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-11-23 22:06:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-23 22:06:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-11-23 22:06:58,561 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-11-23 22:06:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,562 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-11-23 22:06:58,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-11-23 22:06:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:58,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,564 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-11-23 22:06:58,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351569227] [2019-11-23 22:06:58,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,593 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:06:58,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351569227] [2019-11-23 22:06:58,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932882595] [2019-11-23 22:06:58,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,596 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-11-23 22:06:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,624 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-11-23 22:06:58,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,629 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 22:06:58,630 INFO L226 Difference]: Without dead ends: 870 [2019-11-23 22:06:58,631 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:06:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-23 22:06:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-11-23 22:06:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-23 22:06:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-11-23 22:06:58,658 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-11-23 22:06:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,658 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-11-23 22:06:58,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-11-23 22:06:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:58,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,660 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] [2019-11-23 22:06:58,660 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-11-23 22:06:58,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359813109] [2019-11-23 22:06:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,680 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:06:58,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359813109] [2019-11-23 22:06:58,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235258678] [2019-11-23 22:06:58,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,682 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-11-23 22:06:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,708 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-11-23 22:06:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,713 INFO L225 Difference]: With dead ends: 1304 [2019-11-23 22:06:58,714 INFO L226 Difference]: Without dead ends: 886 [2019-11-23 22:06:58,715 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:06:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-23 22:06:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-11-23 22:06:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-11-23 22:06:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-11-23 22:06:58,743 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-11-23 22:06:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,743 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-11-23 22:06:58,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-11-23 22:06:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:58,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,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] [2019-11-23 22:06:58,745 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-11-23 22:06:58,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747101410] [2019-11-23 22:06:58,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:58,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747101410] [2019-11-23 22:06:58,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088448788] [2019-11-23 22:06:58,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,769 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-11-23 22:06:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,801 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-11-23 22:06:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,810 INFO L225 Difference]: With dead ends: 1544 [2019-11-23 22:06:58,811 INFO L226 Difference]: Without dead ends: 1542 [2019-11-23 22:06:58,812 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:06:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-23 22:06:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-11-23 22:06:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-23 22:06:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-11-23 22:06:58,880 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-11-23 22:06:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,881 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-11-23 22:06:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-11-23 22:06:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:58,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,884 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] [2019-11-23 22:06:58,884 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-11-23 22:06:58,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166080675] [2019-11-23 22:06:58,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,904 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:06:58,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166080675] [2019-11-23 22:06:58,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854584148] [2019-11-23 22:06:58,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,907 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-11-23 22:06:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,976 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-11-23 22:06:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,987 INFO L225 Difference]: With dead ends: 2952 [2019-11-23 22:06:58,988 INFO L226 Difference]: Without dead ends: 1702 [2019-11-23 22:06:58,990 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:06:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-11-23 22:06:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-11-23 22:06:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-23 22:06:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-11-23 22:06:59,064 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-11-23 22:06:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:59,064 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-11-23 22:06:59,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-11-23 22:06:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:59,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:59,067 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] [2019-11-23 22:06:59,067 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-11-23 22:06:59,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:59,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986906135] [2019-11-23 22:06:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:59,086 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:06:59,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986906135] [2019-11-23 22:06:59,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324447770] [2019-11-23 22:06:59,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:59,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:59,088 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-11-23 22:06:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:59,142 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-11-23 22:06:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:59,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,154 INFO L225 Difference]: With dead ends: 2552 [2019-11-23 22:06:59,154 INFO L226 Difference]: Without dead ends: 1734 [2019-11-23 22:06:59,156 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:06:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-23 22:06:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-11-23 22:06:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-11-23 22:06:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-11-23 22:06:59,221 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-11-23 22:06:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:59,223 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-11-23 22:06:59,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-11-23 22:06:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:59,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:59,227 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] [2019-11-23 22:06:59,227 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-11-23 22:06:59,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:59,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540744507] [2019-11-23 22:06:59,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:59,252 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:06:59,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540744507] [2019-11-23 22:06:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:59,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575835883] [2019-11-23 22:06:59,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:59,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:59,254 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-11-23 22:06:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:59,311 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-11-23 22:06:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:59,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,325 INFO L225 Difference]: With dead ends: 2952 [2019-11-23 22:06:59,325 INFO L226 Difference]: Without dead ends: 2950 [2019-11-23 22:06:59,326 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:06:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-23 22:06:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-11-23 22:06:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-11-23 22:06:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-11-23 22:06:59,397 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-11-23 22:06:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:59,398 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-11-23 22:06:59,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-11-23 22:06:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:59,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:59,402 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] [2019-11-23 22:06:59,402 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-11-23 22:06:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717572536] [2019-11-23 22:06:59,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:59,424 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:06:59,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717572536] [2019-11-23 22:06:59,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:59,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:59,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562548410] [2019-11-23 22:06:59,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:59,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:59,427 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-11-23 22:06:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:59,502 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-11-23 22:06:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:59,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,518 INFO L225 Difference]: With dead ends: 5832 [2019-11-23 22:06:59,518 INFO L226 Difference]: Without dead ends: 3334 [2019-11-23 22:06:59,545 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:06:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-23 22:06:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-11-23 22:06:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-23 22:06:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-11-23 22:06:59,698 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-11-23 22:06:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:59,699 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-11-23 22:06:59,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-11-23 22:06:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:59,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:59,704 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] [2019-11-23 22:06:59,704 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-11-23 22:06:59,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:59,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604818070] [2019-11-23 22:06:59,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:59,760 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:06:59,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604818070] [2019-11-23 22:06:59,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:59,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:59,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797598672] [2019-11-23 22:06:59,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:59,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:59,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:59,763 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-11-23 22:06:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:59,851 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-11-23 22:06:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:59,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,870 INFO L225 Difference]: With dead ends: 5000 [2019-11-23 22:06:59,871 INFO L226 Difference]: Without dead ends: 3398 [2019-11-23 22:06:59,874 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:06:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-23 22:06:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-11-23 22:06:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-11-23 22:07:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-11-23 22:07:00,011 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-11-23 22:07:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:00,012 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-11-23 22:07:00,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-11-23 22:07:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:07:00,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:00,017 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] [2019-11-23 22:07:00,017 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-11-23 22:07:00,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:00,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404423186] [2019-11-23 22:07:00,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:00,044 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:07:00,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404423186] [2019-11-23 22:07:00,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:00,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:00,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643659365] [2019-11-23 22:07:00,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:00,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:00,048 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-11-23 22:07:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:00,178 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-11-23 22:07:00,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:00,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:07:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:00,217 INFO L225 Difference]: With dead ends: 5640 [2019-11-23 22:07:00,218 INFO L226 Difference]: Without dead ends: 5638 [2019-11-23 22:07:00,219 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:07:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-23 22:07:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-11-23 22:07:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-11-23 22:07:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-11-23 22:07:00,360 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-11-23 22:07:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:00,360 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-11-23 22:07:00,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-11-23 22:07:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:07:00,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:00,369 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] [2019-11-23 22:07:00,369 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-11-23 22:07:00,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:00,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919252252] [2019-11-23 22:07:00,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:00,403 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:07:00,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919252252] [2019-11-23 22:07:00,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:00,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:00,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614226931] [2019-11-23 22:07:00,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:00,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:00,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:00,407 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-11-23 22:07:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:00,559 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-11-23 22:07:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:00,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:07:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:00,580 INFO L225 Difference]: With dead ends: 11528 [2019-11-23 22:07:00,581 INFO L226 Difference]: Without dead ends: 6534 [2019-11-23 22:07:00,588 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:07:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-11-23 22:07:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-11-23 22:07:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-11-23 22:07:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-11-23 22:07:00,786 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-11-23 22:07:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:00,786 INFO L462 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-11-23 22:07:00,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-11-23 22:07:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:07:00,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:00,797 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] [2019-11-23 22:07:00,799 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-11-23 22:07:00,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:00,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187644306] [2019-11-23 22:07:00,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:00,867 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:07:00,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187644306] [2019-11-23 22:07:00,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:00,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:00,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605956437] [2019-11-23 22:07:00,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:00,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:00,869 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-11-23 22:07:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:00,997 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-11-23 22:07:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:00,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:07:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:01,010 INFO L225 Difference]: With dead ends: 9800 [2019-11-23 22:07:01,010 INFO L226 Difference]: Without dead ends: 6662 [2019-11-23 22:07:01,016 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:07:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-11-23 22:07:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-11-23 22:07:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-23 22:07:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-11-23 22:07:01,180 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-11-23 22:07:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:01,180 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-11-23 22:07:01,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-11-23 22:07:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:07:01,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:01,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:01,189 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:01,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-11-23 22:07:01,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912483530] [2019-11-23 22:07:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:01,217 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:07:01,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912483530] [2019-11-23 22:07:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:01,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652538125] [2019-11-23 22:07:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:01,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:01,220 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-11-23 22:07:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:01,418 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-11-23 22:07:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:01,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:07:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:01,438 INFO L225 Difference]: With dead ends: 10758 [2019-11-23 22:07:01,438 INFO L226 Difference]: Without dead ends: 10756 [2019-11-23 22:07:01,442 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:07:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-11-23 22:07:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-11-23 22:07:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-11-23 22:07:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-11-23 22:07:01,639 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-11-23 22:07:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:01,639 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-11-23 22:07:01,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-11-23 22:07:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:07:01,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:01,653 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] [2019-11-23 22:07:01,653 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-11-23 22:07:01,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:01,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685233196] [2019-11-23 22:07:01,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:01,668 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:07:01,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685233196] [2019-11-23 22:07:01,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:01,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:01,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160285277] [2019-11-23 22:07:01,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:01,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:01,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:01,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:01,669 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-11-23 22:07:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:01,841 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-11-23 22:07:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:01,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:07:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:01,842 INFO L225 Difference]: With dead ends: 22788 [2019-11-23 22:07:01,842 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:07:01,862 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:07:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:07:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:07:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:07:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:07:01,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-23 22:07:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:01,863 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:07:01,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:07:01,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:07:01,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:07:01,885 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,885 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,885 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,886 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L447 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 22:07:01,887 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L447 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-11-23 22:07:01,888 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-11-23 22:07:01,888 INFO L447 ceAbstractionStarter]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L440 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-23 22:07:01,889 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,890 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-11-23 22:07:01,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:07:01 BoogieIcfgContainer [2019-11-23 22:07:01,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:07:01,903 INFO L168 Benchmark]: Toolchain (without parser) took 5814.80 ms. Allocated memory was 138.9 MB in the beginning and 342.9 MB in the end (delta: 203.9 MB). Free memory was 102.6 MB in the beginning and 110.0 MB in the end (delta: -7.4 MB). Peak memory consumption was 196.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,904 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.68 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.8 MB in the end (delta: -79.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.57 ms. Allocated memory is still 202.9 MB. Free memory was 181.8 MB in the beginning and 179.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,909 INFO L168 Benchmark]: Boogie Preprocessor took 25.57 ms. Allocated memory is still 202.9 MB. Free memory was 179.9 MB in the beginning and 178.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,915 INFO L168 Benchmark]: RCFGBuilder took 382.32 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 160.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,916 INFO L168 Benchmark]: TraceAbstraction took 4957.96 ms. Allocated memory was 202.9 MB in the beginning and 342.9 MB in the end (delta: 140.0 MB). Free memory was 160.3 MB in the beginning and 110.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 190.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:01,921 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.68 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.8 MB in the end (delta: -79.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.57 ms. Allocated memory is still 202.9 MB. Free memory was 181.8 MB in the beginning and 179.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.57 ms. Allocated memory is still 202.9 MB. Free memory was 179.9 MB in the beginning and 178.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 382.32 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 160.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4957.96 ms. Allocated memory was 202.9 MB in the beginning and 342.9 MB in the end (delta: 140.0 MB). Free memory was 160.3 MB in the beginning and 110.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 190.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 4.8s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...