/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:18,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:18,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:19,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:19,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:19,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:19,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:19,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:19,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:19,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:19,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:19,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:19,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:19,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:19,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:19,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:19,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:19,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:19,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:19,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:19,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:19,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:19,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:19,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:19,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:19,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:19,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:19,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:19,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:19,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:19,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:19,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:19,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:19,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:19,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:19,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:19,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:19,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:19,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:19,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:19,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:19,077 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:19,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:19,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:19,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:19,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:19,113 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:19,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:19,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:19,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:19,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:19,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:19,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:19,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:19,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:19,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:19,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:19,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:19,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:19,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:19,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:19,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:19,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:19,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:19,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:19,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:19,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:19,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:19,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:19,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:19,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:19,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:19,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:19,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:19,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:19,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:19,409 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:19,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-11-23 22:06:19,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ea3689/5d832568e0a148f2ade58741fbff1b55/FLAG288b5a86c [2019-11-23 22:06:19,973 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:19,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-11-23 22:06:19,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ea3689/5d832568e0a148f2ade58741fbff1b55/FLAG288b5a86c [2019-11-23 22:06:20,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ea3689/5d832568e0a148f2ade58741fbff1b55 [2019-11-23 22:06:20,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:20,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:20,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:20,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:20,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:20,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:20" (1/1) ... [2019-11-23 22:06:20,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c49f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20, skipping insertion in model container [2019-11-23 22:06:20,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:20" (1/1) ... [2019-11-23 22:06:20,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:20,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:20,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:20,634 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:20,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:20,674 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:20,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20 WrapperNode [2019-11-23 22:06:20,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:20,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:20,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:20,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:20,768 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:20" (1/1) ... [2019-11-23 22:06:20,774 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:20" (1/1) ... [2019-11-23 22:06:20,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:20,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:20,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:20,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:20,810 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:20" (1/1) ... [2019-11-23 22:06:20,810 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:20" (1/1) ... [2019-11-23 22:06:20,811 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:20" (1/1) ... [2019-11-23 22:06:20,811 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:20" (1/1) ... [2019-11-23 22:06:20,815 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:20" (1/1) ... [2019-11-23 22:06:20,822 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:20" (1/1) ... [2019-11-23 22:06:20,824 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:20" (1/1) ... [2019-11-23 22:06:20,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:20,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:20,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:20,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:20,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (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:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:21,252 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:21,252 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:21,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:21 BoogieIcfgContainer [2019-11-23 22:06:21,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:21,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:21,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:21,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:21,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:20" (1/3) ... [2019-11-23 22:06:21,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5425888f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:21, skipping insertion in model container [2019-11-23 22:06:21,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (2/3) ... [2019-11-23 22:06:21,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5425888f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:21, skipping insertion in model container [2019-11-23 22:06:21,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:21" (3/3) ... [2019-11-23 22:06:21,262 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-23 22:06:21,272 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:21,279 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:21,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:21,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:21,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:21,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:21,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:21,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:21,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:21,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:21,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-23 22:06:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:21,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,354 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:21,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-11-23 22:06:21,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586485770] [2019-11-23 22:06:21,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,563 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:21,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586485770] [2019-11-23 22:06:21,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351468750] [2019-11-23 22:06:21,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,591 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-23 22:06:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,684 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-11-23 22:06:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,700 INFO L225 Difference]: With dead ends: 94 [2019-11-23 22:06:21,700 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 22:06:21,705 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:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 22:06:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-23 22:06:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 22:06:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-11-23 22:06:21,784 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-11-23 22:06:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,785 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-11-23 22:06:21,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-11-23 22:06:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:21,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,787 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:21,788 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-11-23 22:06:21,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289257939] [2019-11-23 22:06:21,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,912 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:21,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289257939] [2019-11-23 22:06:21,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984499647] [2019-11-23 22:06:21,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,920 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-11-23 22:06:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,964 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-11-23 22:06:21,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,969 INFO L225 Difference]: With dead ends: 133 [2019-11-23 22:06:21,970 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 22:06:21,971 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:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 22:06:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-23 22:06:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 22:06:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-11-23 22:06:21,989 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-11-23 22:06:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,989 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-11-23 22:06:21,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-11-23 22:06:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:21,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,991 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:21,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-11-23 22:06:21,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758685155] [2019-11-23 22:06:21,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,051 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:22,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758685155] [2019-11-23 22:06:22,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577184599] [2019-11-23 22:06:22,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,055 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-11-23 22:06:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,090 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-11-23 22:06:22,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,093 INFO L225 Difference]: With dead ends: 122 [2019-11-23 22:06:22,093 INFO L226 Difference]: Without dead ends: 83 [2019-11-23 22:06:22,097 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:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-23 22:06:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-23 22:06:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 22:06:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-11-23 22:06:22,105 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-11-23 22:06:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,106 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-11-23 22:06:22,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-11-23 22:06:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:22,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,107 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:22,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-11-23 22:06:22,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480544316] [2019-11-23 22:06:22,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,167 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:22,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480544316] [2019-11-23 22:06:22,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28491312] [2019-11-23 22:06:22,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,170 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-11-23 22:06:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,187 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-11-23 22:06:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,189 INFO L225 Difference]: With dead ends: 156 [2019-11-23 22:06:22,189 INFO L226 Difference]: Without dead ends: 154 [2019-11-23 22:06:22,190 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:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-23 22:06:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-11-23 22:06:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-23 22:06:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-11-23 22:06:22,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-11-23 22:06:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,200 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-11-23 22:06:22,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-11-23 22:06:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:22,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,202 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:22,202 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-11-23 22:06:22,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929634849] [2019-11-23 22:06:22,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,245 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:22,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929634849] [2019-11-23 22:06:22,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639549178] [2019-11-23 22:06:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,249 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-11-23 22:06:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,276 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-11-23 22:06:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,278 INFO L225 Difference]: With dead ends: 260 [2019-11-23 22:06:22,278 INFO L226 Difference]: Without dead ends: 156 [2019-11-23 22:06:22,280 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:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-23 22:06:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-23 22:06:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-23 22:06:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-11-23 22:06:22,293 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-11-23 22:06:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,294 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-11-23 22:06:22,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-11-23 22:06:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:22,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,295 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:22,296 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-11-23 22:06:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079656376] [2019-11-23 22:06:22,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,353 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:22,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079656376] [2019-11-23 22:06:22,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875412709] [2019-11-23 22:06:22,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,360 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-11-23 22:06:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,388 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-11-23 22:06:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,390 INFO L225 Difference]: With dead ends: 233 [2019-11-23 22:06:22,391 INFO L226 Difference]: Without dead ends: 158 [2019-11-23 22:06:22,392 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:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-23 22:06:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-23 22:06:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-23 22:06:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-11-23 22:06:22,423 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-11-23 22:06:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,423 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-11-23 22:06:22,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-11-23 22:06:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:22,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,425 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:22,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-11-23 22:06:22,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087178012] [2019-11-23 22:06:22,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:22,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087178012] [2019-11-23 22:06:22,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444418876] [2019-11-23 22:06:22,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,481 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-11-23 22:06:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,511 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-11-23 22:06:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,514 INFO L225 Difference]: With dead ends: 452 [2019-11-23 22:06:22,514 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:06:22,515 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:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:06:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-23 22:06:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-23 22:06:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-11-23 22:06:22,528 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-11-23 22:06:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,528 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-11-23 22:06:22,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-11-23 22:06:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:22,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,530 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:22,530 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,531 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-11-23 22:06:22,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451760014] [2019-11-23 22:06:22,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:22,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451760014] [2019-11-23 22:06:22,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141761105] [2019-11-23 22:06:22,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,578 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-11-23 22:06:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,606 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-11-23 22:06:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,609 INFO L225 Difference]: With dead ends: 384 [2019-11-23 22:06:22,609 INFO L226 Difference]: Without dead ends: 382 [2019-11-23 22:06:22,609 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:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-23 22:06:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-11-23 22:06:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-23 22:06:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-11-23 22:06:22,620 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-11-23 22:06:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,621 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-11-23 22:06:22,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-11-23 22:06:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:22,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,623 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:22,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-11-23 22:06:22,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133799288] [2019-11-23 22:06:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,654 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:22,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133799288] [2019-11-23 22:06:22,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204922076] [2019-11-23 22:06:22,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,658 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-11-23 22:06:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,688 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-11-23 22:06:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,692 INFO L225 Difference]: With dead ends: 564 [2019-11-23 22:06:22,693 INFO L226 Difference]: Without dead ends: 562 [2019-11-23 22:06:22,693 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:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-23 22:06:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-11-23 22:06:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-23 22:06:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-11-23 22:06:22,717 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-11-23 22:06:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,717 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-11-23 22:06:22,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-11-23 22:06:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:22,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,720 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:22,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-11-23 22:06:22,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689717994] [2019-11-23 22:06:22,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,759 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:22,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689717994] [2019-11-23 22:06:22,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477059665] [2019-11-23 22:06:22,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,763 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-11-23 22:06:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,795 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-11-23 22:06:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,799 INFO L225 Difference]: With dead ends: 996 [2019-11-23 22:06:22,799 INFO L226 Difference]: Without dead ends: 586 [2019-11-23 22:06:22,801 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:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-23 22:06:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-23 22:06:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-23 22:06:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-11-23 22:06:22,828 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-11-23 22:06:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,837 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-11-23 22:06:22,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-11-23 22:06:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:22,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,838 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:22,839 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-11-23 22:06:22,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080194779] [2019-11-23 22:06:22,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,870 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:22,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080194779] [2019-11-23 22:06:22,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931812302] [2019-11-23 22:06:22,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,874 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-11-23 22:06:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,899 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-11-23 22:06:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,903 INFO L225 Difference]: With dead ends: 884 [2019-11-23 22:06:22,904 INFO L226 Difference]: Without dead ends: 598 [2019-11-23 22:06:22,905 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:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-23 22:06:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-23 22:06:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-23 22:06:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-11-23 22:06:22,924 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-11-23 22:06:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,924 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-11-23 22:06:22,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-11-23 22:06:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:22,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,927 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:22,927 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-11-23 22:06:22,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197036079] [2019-11-23 22:06:22,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,968 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:22,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197036079] [2019-11-23 22:06:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809230757] [2019-11-23 22:06:22,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,971 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-11-23 22:06:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,994 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-11-23 22:06:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,003 INFO L225 Difference]: With dead ends: 1096 [2019-11-23 22:06:23,003 INFO L226 Difference]: Without dead ends: 1094 [2019-11-23 22:06:23,004 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:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-23 22:06:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-11-23 22:06:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-23 22:06:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-11-23 22:06:23,029 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-11-23 22:06:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,029 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-11-23 22:06:23,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-11-23 22:06:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:23,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,032 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:23,032 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-11-23 22:06:23,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648989367] [2019-11-23 22:06:23,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,080 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:23,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648989367] [2019-11-23 22:06:23,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696592952] [2019-11-23 22:06:23,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,084 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-11-23 22:06:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,114 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-11-23 22:06:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,121 INFO L225 Difference]: With dead ends: 1976 [2019-11-23 22:06:23,122 INFO L226 Difference]: Without dead ends: 1158 [2019-11-23 22:06:23,123 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:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-23 22:06:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-11-23 22:06:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-23 22:06:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-11-23 22:06:23,159 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-11-23 22:06:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,160 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-11-23 22:06:23,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-11-23 22:06:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:23,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,162 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:06:23,162 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-11-23 22:06:23,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299832603] [2019-11-23 22:06:23,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:23,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299832603] [2019-11-23 22:06:23,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689145351] [2019-11-23 22:06:23,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,188 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-11-23 22:06:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,216 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-11-23 22:06:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,223 INFO L225 Difference]: With dead ends: 1736 [2019-11-23 22:06:23,223 INFO L226 Difference]: Without dead ends: 1174 [2019-11-23 22:06:23,225 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:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-23 22:06:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-11-23 22:06:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-23 22:06:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-11-23 22:06:23,271 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-11-23 22:06:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,272 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-11-23 22:06:23,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-11-23 22:06:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:23,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,275 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:06:23,275 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-11-23 22:06:23,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233853106] [2019-11-23 22:06:23,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,302 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:23,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233853106] [2019-11-23 22:06:23,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063915292] [2019-11-23 22:06:23,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,304 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-11-23 22:06:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,338 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-11-23 22:06:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,350 INFO L225 Difference]: With dead ends: 2120 [2019-11-23 22:06:23,350 INFO L226 Difference]: Without dead ends: 2118 [2019-11-23 22:06:23,352 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:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-23 22:06:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-11-23 22:06:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-23 22:06:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-11-23 22:06:23,404 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-11-23 22:06:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,404 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-11-23 22:06:23,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-11-23 22:06:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:23,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,407 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:06:23,407 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-11-23 22:06:23,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597653882] [2019-11-23 22:06:23,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,447 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:23,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597653882] [2019-11-23 22:06:23,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144434088] [2019-11-23 22:06:23,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,452 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-11-23 22:06:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,498 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-11-23 22:06:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,508 INFO L225 Difference]: With dead ends: 3912 [2019-11-23 22:06:23,509 INFO L226 Difference]: Without dead ends: 2278 [2019-11-23 22:06:23,511 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:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-23 22:06:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-11-23 22:06:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-11-23 22:06:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-11-23 22:06:23,568 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-11-23 22:06:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,568 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-11-23 22:06:23,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-11-23 22:06:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:23,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:23,572 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-11-23 22:06:23,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693278174] [2019-11-23 22:06:23,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,590 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:23,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693278174] [2019-11-23 22:06:23,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545850992] [2019-11-23 22:06:23,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,592 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-11-23 22:06:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,628 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-11-23 22:06:23,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,638 INFO L225 Difference]: With dead ends: 3416 [2019-11-23 22:06:23,638 INFO L226 Difference]: Without dead ends: 2310 [2019-11-23 22:06:23,641 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:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-23 22:06:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-11-23 22:06:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-23 22:06:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-11-23 22:06:23,696 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-11-23 22:06:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,696 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-11-23 22:06:23,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-11-23 22:06:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:23,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:23,699 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-11-23 22:06:23,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351686904] [2019-11-23 22:06:23,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,741 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:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351686904] [2019-11-23 22:06:23,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372067555] [2019-11-23 22:06:23,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,743 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-11-23 22:06:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,790 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-11-23 22:06:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,808 INFO L225 Difference]: With dead ends: 4104 [2019-11-23 22:06:23,809 INFO L226 Difference]: Without dead ends: 4102 [2019-11-23 22:06:23,811 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:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-23 22:06:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-11-23 22:06:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-23 22:06:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-11-23 22:06:23,887 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-11-23 22:06:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,887 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-11-23 22:06:23,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-11-23 22:06:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:23,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:23,893 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-11-23 22:06:23,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197594365] [2019-11-23 22:06:23,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,918 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:23,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197594365] [2019-11-23 22:06:23,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649736026] [2019-11-23 22:06:23,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,920 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-11-23 22:06:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,008 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-11-23 22:06:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,028 INFO L225 Difference]: With dead ends: 7752 [2019-11-23 22:06:24,029 INFO L226 Difference]: Without dead ends: 4486 [2019-11-23 22:06:24,035 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:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-23 22:06:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-11-23 22:06:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-23 22:06:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-11-23 22:06:24,204 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-11-23 22:06:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,205 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-11-23 22:06:24,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-11-23 22:06:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:24,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:24,210 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-11-23 22:06:24,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240814705] [2019-11-23 22:06:24,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,240 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:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240814705] [2019-11-23 22:06:24,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341580671] [2019-11-23 22:06:24,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,243 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-11-23 22:06:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,299 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-11-23 22:06:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,329 INFO L225 Difference]: With dead ends: 6728 [2019-11-23 22:06:24,329 INFO L226 Difference]: Without dead ends: 4550 [2019-11-23 22:06:24,333 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:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-23 22:06:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-11-23 22:06:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-11-23 22:06:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-11-23 22:06:24,442 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-11-23 22:06:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,442 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-11-23 22:06:24,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-11-23 22:06:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:24,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:24,448 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-11-23 22:06:24,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542954611] [2019-11-23 22:06:24,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,467 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:24,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542954611] [2019-11-23 22:06:24,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843485608] [2019-11-23 22:06:24,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,469 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-11-23 22:06:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,568 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-11-23 22:06:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,584 INFO L225 Difference]: With dead ends: 7944 [2019-11-23 22:06:24,584 INFO L226 Difference]: Without dead ends: 7942 [2019-11-23 22:06:24,587 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:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-11-23 22:06:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-11-23 22:06:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-23 22:06:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-11-23 22:06:24,805 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-11-23 22:06:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,806 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-11-23 22:06:24,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-11-23 22:06:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:24,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:24,815 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-11-23 22:06:24,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632288829] [2019-11-23 22:06:24,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,837 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:24,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632288829] [2019-11-23 22:06:24,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337330549] [2019-11-23 22:06:24,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,839 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-11-23 22:06:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,946 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-11-23 22:06:24,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,963 INFO L225 Difference]: With dead ends: 15368 [2019-11-23 22:06:24,964 INFO L226 Difference]: Without dead ends: 8838 [2019-11-23 22:06:24,973 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:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-11-23 22:06:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-11-23 22:06:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-11-23 22:06:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-11-23 22:06:25,246 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-11-23 22:06:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,247 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-11-23 22:06:25,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-11-23 22:06:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:25,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:25,256 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-11-23 22:06:25,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530106508] [2019-11-23 22:06:25,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,273 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:25,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530106508] [2019-11-23 22:06:25,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82785648] [2019-11-23 22:06:25,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,275 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-11-23 22:06:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,368 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-11-23 22:06:25,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,384 INFO L225 Difference]: With dead ends: 13256 [2019-11-23 22:06:25,384 INFO L226 Difference]: Without dead ends: 8966 [2019-11-23 22:06:25,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-23 22:06:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-11-23 22:06:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-11-23 22:06:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-11-23 22:06:25,551 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-11-23 22:06:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,551 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-11-23 22:06:25,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-11-23 22:06:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:25,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:25,560 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-11-23 22:06:25,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644924250] [2019-11-23 22:06:25,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,588 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:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644924250] [2019-11-23 22:06:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302015126] [2019-11-23 22:06:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,590 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-11-23 22:06:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,818 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-11-23 22:06:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,842 INFO L225 Difference]: With dead ends: 15368 [2019-11-23 22:06:25,842 INFO L226 Difference]: Without dead ends: 15366 [2019-11-23 22:06:25,847 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:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-11-23 22:06:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-11-23 22:06:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-11-23 22:06:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-11-23 22:06:26,066 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-11-23 22:06:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,067 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-11-23 22:06:26,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-11-23 22:06:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:26,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:26,083 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-11-23 22:06:26,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340920756] [2019-11-23 22:06:26,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,104 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:26,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340920756] [2019-11-23 22:06:26,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660994202] [2019-11-23 22:06:26,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,106 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-11-23 22:06:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,428 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-11-23 22:06:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,456 INFO L225 Difference]: With dead ends: 30472 [2019-11-23 22:06:26,456 INFO L226 Difference]: Without dead ends: 17414 [2019-11-23 22:06:26,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:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-11-23 22:06:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-11-23 22:06:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-11-23 22:06:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-11-23 22:06:26,765 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-11-23 22:06:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,765 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-11-23 22:06:26,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-11-23 22:06:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:26,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:26,783 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-11-23 22:06:26,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501102329] [2019-11-23 22:06:26,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,803 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:26,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501102329] [2019-11-23 22:06:26,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978674228] [2019-11-23 22:06:26,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,805 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-11-23 22:06:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:27,349 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-11-23 22:06:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:27,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:27,378 INFO L225 Difference]: With dead ends: 26120 [2019-11-23 22:06:27,378 INFO L226 Difference]: Without dead ends: 17670 [2019-11-23 22:06:27,388 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:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-11-23 22:06:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-11-23 22:06:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-11-23 22:06:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-11-23 22:06:27,704 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-11-23 22:06:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:27,704 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-11-23 22:06:27,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-11-23 22:06:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:27,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:27,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:27,729 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-11-23 22:06:27,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:27,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552934564] [2019-11-23 22:06:27,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:27,748 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:27,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552934564] [2019-11-23 22:06:27,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:27,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:27,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164182591] [2019-11-23 22:06:27,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:27,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:27,750 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-11-23 22:06:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:28,070 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-11-23 22:06:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:28,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:28,128 INFO L225 Difference]: With dead ends: 29704 [2019-11-23 22:06:28,128 INFO L226 Difference]: Without dead ends: 29702 [2019-11-23 22:06:28,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-11-23 22:06:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-11-23 22:06:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-11-23 22:06:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-11-23 22:06:28,607 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-11-23 22:06:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:28,607 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-11-23 22:06:28,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-11-23 22:06:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:28,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:28,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:28,635 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-11-23 22:06:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:28,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627210684] [2019-11-23 22:06:28,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:28,665 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:28,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627210684] [2019-11-23 22:06:28,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:28,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:28,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721318414] [2019-11-23 22:06:28,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:28,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:28,668 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-11-23 22:06:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:29,154 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-11-23 22:06:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:29,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:29,202 INFO L225 Difference]: With dead ends: 60424 [2019-11-23 22:06:29,202 INFO L226 Difference]: Without dead ends: 34310 [2019-11-23 22:06:29,231 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:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-11-23 22:06:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-11-23 22:06:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-11-23 22:06:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-11-23 22:06:29,954 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-11-23 22:06:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:29,954 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-11-23 22:06:29,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-11-23 22:06:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:29,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:29,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:29,979 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-11-23 22:06:29,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:29,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552442150] [2019-11-23 22:06:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:30,004 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:30,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552442150] [2019-11-23 22:06:30,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:30,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:30,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609326211] [2019-11-23 22:06:30,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:30,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:30,008 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-11-23 22:06:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:30,323 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-11-23 22:06:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:30,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:30,365 INFO L225 Difference]: With dead ends: 51464 [2019-11-23 22:06:30,365 INFO L226 Difference]: Without dead ends: 34822 [2019-11-23 22:06:30,381 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:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-11-23 22:06:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-11-23 22:06:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-11-23 22:06:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-11-23 22:06:30,949 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-11-23 22:06:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:30,949 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-11-23 22:06:30,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-11-23 22:06:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:31,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:31,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:31,679 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-11-23 22:06:31,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:31,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286518743] [2019-11-23 22:06:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:31,698 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:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286518743] [2019-11-23 22:06:31,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:31,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:31,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069422854] [2019-11-23 22:06:31,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:31,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:31,700 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-11-23 22:06:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:32,303 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-11-23 22:06:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:32,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:32,386 INFO L225 Difference]: With dead ends: 101384 [2019-11-23 22:06:32,387 INFO L226 Difference]: Without dead ends: 67590 [2019-11-23 22:06:32,416 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:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-11-23 22:06:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-11-23 22:06:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-23 22:06:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-11-23 22:06:33,945 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-11-23 22:06:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:33,945 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-11-23 22:06:33,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-11-23 22:06:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:33,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:33,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:33,977 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-11-23 22:06:33,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:33,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694176716] [2019-11-23 22:06:33,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:34,013 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:34,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694176716] [2019-11-23 22:06:34,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:34,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:34,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426384027] [2019-11-23 22:06:34,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:34,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:34,015 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-11-23 22:06:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:34,744 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-11-23 22:06:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:34,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:34,795 INFO L225 Difference]: With dead ends: 71688 [2019-11-23 22:06:34,795 INFO L226 Difference]: Without dead ends: 71686 [2019-11-23 22:06:34,804 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:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-11-23 22:06:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-11-23 22:06:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-23 22:06:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-11-23 22:06:37,011 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-11-23 22:06:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:37,012 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-11-23 22:06:37,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-11-23 22:06:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:37,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:37,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:37,047 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-11-23 22:06:37,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:37,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518097923] [2019-11-23 22:06:37,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:37,063 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:37,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518097923] [2019-11-23 22:06:37,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:37,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:37,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264798308] [2019-11-23 22:06:37,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:37,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:37,065 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-11-23 22:06:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:38,110 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-11-23 22:06:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:38,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:38,232 INFO L225 Difference]: With dead ends: 109574 [2019-11-23 22:06:38,232 INFO L226 Difference]: Without dead ends: 109572 [2019-11-23 22:06:38,260 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:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-11-23 22:06:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-11-23 22:06:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-11-23 22:06:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-11-23 22:06:39,509 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-11-23 22:06:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,509 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-11-23 22:06:39,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-11-23 22:06:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:39,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,577 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-11-23 22:06:39,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005693003] [2019-11-23 22:06:39,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,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:39,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005693003] [2019-11-23 22:06:39,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463508984] [2019-11-23 22:06:39,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,594 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-11-23 22:06:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,801 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-11-23 22:06:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,801 INFO L225 Difference]: With dead ends: 236548 [2019-11-23 22:06:40,801 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:06:40,855 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:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:06:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:06:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:06:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:06:40,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-23 22:06:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,856 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:06:40,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:06:40,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:06:40,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:06:40,894 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,894 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,895 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L447 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,896 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-23 22:06:40,897 INFO L447 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L447 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L440 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,898 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-23 22:06:40,899 INFO L444 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-23 22:06:40,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:06:40 BoogieIcfgContainer [2019-11-23 22:06:40,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:06:40,911 INFO L168 Benchmark]: Toolchain (without parser) took 20532.70 ms. Allocated memory was 147.3 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 105.4 MB in the beginning and 683.7 MB in the end (delta: -578.3 MB). Peak memory consumption was 989.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,912 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 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:06:40,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 147.3 MB. Free memory was 105.2 MB in the beginning and 94.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.24 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 94.0 MB in the beginning and 182.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,914 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 ms. Allocated memory is still 205.0 MB. Free memory was 182.3 MB in the beginning and 181.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,914 INFO L168 Benchmark]: RCFGBuilder took 427.01 ms. Allocated memory is still 205.0 MB. Free memory was 181.0 MB in the beginning and 160.6 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,915 INFO L168 Benchmark]: TraceAbstraction took 19654.52 ms. Allocated memory was 205.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 159.9 MB in the beginning and 683.7 MB in the end (delta: -523.8 MB). Peak memory consumption was 986.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:40,917 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 147.3 MB. Free memory was 105.2 MB in the beginning and 94.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 124.24 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 94.0 MB in the beginning and 182.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.29 ms. Allocated memory is still 205.0 MB. Free memory was 182.3 MB in the beginning and 181.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.01 ms. Allocated memory is still 205.0 MB. Free memory was 181.0 MB in the beginning and 160.6 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19654.52 ms. Allocated memory was 205.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 159.9 MB in the beginning and 683.7 MB in the end (delta: -523.8 MB). Peak memory consumption was 986.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 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 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 19.5s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...