/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/ssh-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:22,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:22,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:22,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:22,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:22,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:22,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:22,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:22,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:22,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:22,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:22,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:22,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:22,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:22,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:22,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:22,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:22,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:22,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:22,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:22,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:22,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:22,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:22,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:22,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:22,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:22,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:22,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:22,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:22,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:22,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:22,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:22,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:22,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:22,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:22,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:22,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:22,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:22,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:22,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:22,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:22,099 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:48:22,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:22,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:22,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:22,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:22,123 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:22,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:22,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:22,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:22,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:22,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:22,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:22,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:22,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:22,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:22,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:22,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:22,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:22,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:22,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:22,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:22,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:22,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:22,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:22,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:22,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:22,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:22,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:22,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:22,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:22,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:22,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:22,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:22,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:22,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:22,417 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:22,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-23 22:48:22,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67111469d/075bca1f38384ae686f788b6146b1ca7/FLAG78f2c9a4e [2019-11-23 22:48:23,033 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:23,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-23 22:48:23,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67111469d/075bca1f38384ae686f788b6146b1ca7/FLAG78f2c9a4e [2019-11-23 22:48:23,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67111469d/075bca1f38384ae686f788b6146b1ca7 [2019-11-23 22:48:23,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:23,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:23,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:23,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:23,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:23,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753efe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23, skipping insertion in model container [2019-11-23 22:48:23,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:23,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:23,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:23,811 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:23,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:23,894 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:23,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23 WrapperNode [2019-11-23 22:48:23,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:23,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:23,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:23,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:23,903 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:48:23" (1/1) ... [2019-11-23 22:48:23,913 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:48:23" (1/1) ... [2019-11-23 22:48:23,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:23,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:23,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:23,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:23,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:24,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:24,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:24,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:24,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:24,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:24,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (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:48:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:24,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:24,212 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:24,955 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:24,955 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:24,956 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:24,956 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:24,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:24 BoogieIcfgContainer [2019-11-23 22:48:24,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:24,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:24,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:24,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:24,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:23" (1/3) ... [2019-11-23 22:48:24,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8939d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:24, skipping insertion in model container [2019-11-23 22:48:24,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23" (2/3) ... [2019-11-23 22:48:24,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8939d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:24, skipping insertion in model container [2019-11-23 22:48:24,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:24" (3/3) ... [2019-11-23 22:48:24,966 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-11-23 22:48:24,975 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:24,983 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:24,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:25,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:25,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:25,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:25,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:25,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:25,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:25,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:25,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-23 22:48:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:48:25,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:25,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times [2019-11-23 22:48:25,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182236945] [2019-11-23 22:48:25,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,350 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:48:25,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182236945] [2019-11-23 22:48:25,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:25,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:25,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188767968] [2019-11-23 22:48:25,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:25,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:25,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,384 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-11-23 22:48:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:25,706 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2019-11-23 22:48:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:25,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:48:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:25,722 INFO L225 Difference]: With dead ends: 328 [2019-11-23 22:48:25,722 INFO L226 Difference]: Without dead ends: 170 [2019-11-23 22:48:25,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-23 22:48:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2019-11-23 22:48:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-23 22:48:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2019-11-23 22:48:25,780 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32 [2019-11-23 22:48:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:25,780 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2019-11-23 22:48:25,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2019-11-23 22:48:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:48:25,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:25,783 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times [2019-11-23 22:48:25,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461620504] [2019-11-23 22:48:25,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,876 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:48:25,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461620504] [2019-11-23 22:48:25,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:25,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:25,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077649263] [2019-11-23 22:48:25,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:25,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,882 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states. [2019-11-23 22:48:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,082 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions. [2019-11-23 22:48:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:48:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,085 INFO L225 Difference]: With dead ends: 350 [2019-11-23 22:48:26,085 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 22:48:26,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 22:48:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-11-23 22:48:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-23 22:48:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions. [2019-11-23 22:48:26,104 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33 [2019-11-23 22:48:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,105 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions. [2019-11-23 22:48:26,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions. [2019-11-23 22:48:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:48:26,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:26,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times [2019-11-23 22:48:26,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678786010] [2019-11-23 22:48:26,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,190 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:48:26,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678786010] [2019-11-23 22:48:26,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:26,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:26,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562973324] [2019-11-23 22:48:26,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,193 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states. [2019-11-23 22:48:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,411 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions. [2019-11-23 22:48:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:48:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,414 INFO L225 Difference]: With dead ends: 411 [2019-11-23 22:48:26,414 INFO L226 Difference]: Without dead ends: 231 [2019-11-23 22:48:26,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-23 22:48:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-11-23 22:48:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 22:48:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions. [2019-11-23 22:48:26,454 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39 [2019-11-23 22:48:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,456 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions. [2019-11-23 22:48:26,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions. [2019-11-23 22:48:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:26,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:26,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times [2019-11-23 22:48:26,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429683808] [2019-11-23 22:48:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,576 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:48:26,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429683808] [2019-11-23 22:48:26,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:26,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:26,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624258814] [2019-11-23 22:48:26,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,580 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states. [2019-11-23 22:48:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,768 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions. [2019-11-23 22:48:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,772 INFO L225 Difference]: With dead ends: 460 [2019-11-23 22:48:26,772 INFO L226 Difference]: Without dead ends: 242 [2019-11-23 22:48:26,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-23 22:48:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-11-23 22:48:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-23 22:48:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions. [2019-11-23 22:48:26,786 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40 [2019-11-23 22:48:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,786 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions. [2019-11-23 22:48:26,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions. [2019-11-23 22:48:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:48:26,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,788 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:26,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times [2019-11-23 22:48:26,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625007271] [2019-11-23 22:48:26,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:26,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625007271] [2019-11-23 22:48:26,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:26,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:26,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141331332] [2019-11-23 22:48:26,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,844 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states. [2019-11-23 22:48:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,011 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions. [2019-11-23 22:48:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-23 22:48:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,013 INFO L225 Difference]: With dead ends: 504 [2019-11-23 22:48:27,014 INFO L226 Difference]: Without dead ends: 275 [2019-11-23 22:48:27,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-23 22:48:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-23 22:48:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:48:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions. [2019-11-23 22:48:27,026 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58 [2019-11-23 22:48:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,027 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions. [2019-11-23 22:48:27,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions. [2019-11-23 22:48:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:48:27,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,030 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times [2019-11-23 22:48:27,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451319343] [2019-11-23 22:48:27,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:27,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451319343] [2019-11-23 22:48:27,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937344522] [2019-11-23 22:48:27,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,070 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states. [2019-11-23 22:48:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,217 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions. [2019-11-23 22:48:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-23 22:48:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,220 INFO L225 Difference]: With dead ends: 529 [2019-11-23 22:48:27,220 INFO L226 Difference]: Without dead ends: 275 [2019-11-23 22:48:27,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-23 22:48:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-23 22:48:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:48:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2019-11-23 22:48:27,232 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59 [2019-11-23 22:48:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,232 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2019-11-23 22:48:27,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2019-11-23 22:48:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:48:27,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,234 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,234 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times [2019-11-23 22:48:27,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060976803] [2019-11-23 22:48:27,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:27,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060976803] [2019-11-23 22:48:27,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242620575] [2019-11-23 22:48:27,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,277 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states. [2019-11-23 22:48:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,461 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-11-23 22:48:27,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-23 22:48:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,464 INFO L225 Difference]: With dead ends: 546 [2019-11-23 22:48:27,464 INFO L226 Difference]: Without dead ends: 292 [2019-11-23 22:48:27,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-23 22:48:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-11-23 22:48:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-23 22:48:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions. [2019-11-23 22:48:27,476 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60 [2019-11-23 22:48:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,477 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions. [2019-11-23 22:48:27,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions. [2019-11-23 22:48:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:48:27,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,478 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times [2019-11-23 22:48:27,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666990135] [2019-11-23 22:48:27,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:27,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666990135] [2019-11-23 22:48:27,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297352606] [2019-11-23 22:48:27,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,516 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states. [2019-11-23 22:48:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,635 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-23 22:48:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:48:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,638 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:48:27,638 INFO L226 Difference]: Without dead ends: 309 [2019-11-23 22:48:27,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-23 22:48:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-11-23 22:48:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-23 22:48:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions. [2019-11-23 22:48:27,653 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72 [2019-11-23 22:48:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,653 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions. [2019-11-23 22:48:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions. [2019-11-23 22:48:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:48:27,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,655 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times [2019-11-23 22:48:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477811914] [2019-11-23 22:48:27,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:27,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477811914] [2019-11-23 22:48:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918014966] [2019-11-23 22:48:27,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,697 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states. [2019-11-23 22:48:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,841 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions. [2019-11-23 22:48:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:48:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,844 INFO L225 Difference]: With dead ends: 645 [2019-11-23 22:48:27,845 INFO L226 Difference]: Without dead ends: 345 [2019-11-23 22:48:27,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-23 22:48:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-23 22:48:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-23 22:48:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions. [2019-11-23 22:48:27,857 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72 [2019-11-23 22:48:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,858 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions. [2019-11-23 22:48:27,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions. [2019-11-23 22:48:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:27,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,860 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times [2019-11-23 22:48:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756322055] [2019-11-23 22:48:27,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:27,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756322055] [2019-11-23 22:48:27,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568925981] [2019-11-23 22:48:27,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,892 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states. [2019-11-23 22:48:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,039 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions. [2019-11-23 22:48:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,042 INFO L225 Difference]: With dead ends: 681 [2019-11-23 22:48:28,042 INFO L226 Difference]: Without dead ends: 345 [2019-11-23 22:48:28,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-23 22:48:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-23 22:48:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-23 22:48:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions. [2019-11-23 22:48:28,055 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73 [2019-11-23 22:48:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,056 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions. [2019-11-23 22:48:28,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions. [2019-11-23 22:48:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:28,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,057 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,057 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times [2019-11-23 22:48:28,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344888017] [2019-11-23 22:48:28,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:28,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344888017] [2019-11-23 22:48:28,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587247515] [2019-11-23 22:48:28,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,093 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states. [2019-11-23 22:48:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,250 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions. [2019-11-23 22:48:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,253 INFO L225 Difference]: With dead ends: 681 [2019-11-23 22:48:28,253 INFO L226 Difference]: Without dead ends: 345 [2019-11-23 22:48:28,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-23 22:48:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-23 22:48:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-23 22:48:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-11-23 22:48:28,266 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73 [2019-11-23 22:48:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,266 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-11-23 22:48:28,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-11-23 22:48:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 22:48:28,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,268 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,268 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times [2019-11-23 22:48:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587514728] [2019-11-23 22:48:28,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 22:48:28,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587514728] [2019-11-23 22:48:28,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732230596] [2019-11-23 22:48:28,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,306 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states. [2019-11-23 22:48:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,485 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2019-11-23 22:48:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-23 22:48:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,488 INFO L225 Difference]: With dead ends: 708 [2019-11-23 22:48:28,488 INFO L226 Difference]: Without dead ends: 372 [2019-11-23 22:48:28,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-23 22:48:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-11-23 22:48:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-23 22:48:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions. [2019-11-23 22:48:28,507 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79 [2019-11-23 22:48:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,507 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions. [2019-11-23 22:48:28,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions. [2019-11-23 22:48:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:48:28,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,509 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times [2019-11-23 22:48:28,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471417282] [2019-11-23 22:48:28,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 22:48:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471417282] [2019-11-23 22:48:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032258371] [2019-11-23 22:48:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,550 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states. [2019-11-23 22:48:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,723 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions. [2019-11-23 22:48:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 22:48:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,725 INFO L225 Difference]: With dead ends: 732 [2019-11-23 22:48:28,726 INFO L226 Difference]: Without dead ends: 372 [2019-11-23 22:48:28,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-23 22:48:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-11-23 22:48:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-23 22:48:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions. [2019-11-23 22:48:28,742 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80 [2019-11-23 22:48:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,742 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions. [2019-11-23 22:48:28,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions. [2019-11-23 22:48:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:48:28,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,744 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,744 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times [2019-11-23 22:48:28,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827738034] [2019-11-23 22:48:28,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 22:48:28,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827738034] [2019-11-23 22:48:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392015340] [2019-11-23 22:48:28,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,808 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states. [2019-11-23 22:48:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,930 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2019-11-23 22:48:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:48:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,934 INFO L225 Difference]: With dead ends: 736 [2019-11-23 22:48:28,934 INFO L226 Difference]: Without dead ends: 376 [2019-11-23 22:48:28,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-23 22:48:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-11-23 22:48:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-23 22:48:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2019-11-23 22:48:28,950 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85 [2019-11-23 22:48:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,950 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2019-11-23 22:48:28,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2019-11-23 22:48:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:48:28,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,954 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,955 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times [2019-11-23 22:48:28,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059000980] [2019-11-23 22:48:28,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:29,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059000980] [2019-11-23 22:48:29,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000897144] [2019-11-23 22:48:29,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,014 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states. [2019-11-23 22:48:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,188 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions. [2019-11-23 22:48:29,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 22:48:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,191 INFO L225 Difference]: With dead ends: 776 [2019-11-23 22:48:29,192 INFO L226 Difference]: Without dead ends: 407 [2019-11-23 22:48:29,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-23 22:48:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-11-23 22:48:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-23 22:48:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions. [2019-11-23 22:48:29,211 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86 [2019-11-23 22:48:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,212 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions. [2019-11-23 22:48:29,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions. [2019-11-23 22:48:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-23 22:48:29,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,215 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,216 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times [2019-11-23 22:48:29,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966109173] [2019-11-23 22:48:29,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:29,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966109173] [2019-11-23 22:48:29,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146403215] [2019-11-23 22:48:29,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,251 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states. [2019-11-23 22:48:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,392 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions. [2019-11-23 22:48:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-23 22:48:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,395 INFO L225 Difference]: With dead ends: 805 [2019-11-23 22:48:29,395 INFO L226 Difference]: Without dead ends: 407 [2019-11-23 22:48:29,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-23 22:48:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-11-23 22:48:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-23 22:48:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions. [2019-11-23 22:48:29,411 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87 [2019-11-23 22:48:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,411 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions. [2019-11-23 22:48:29,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions. [2019-11-23 22:48:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:29,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,413 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times [2019-11-23 22:48:29,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633519530] [2019-11-23 22:48:29,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 22:48:29,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633519530] [2019-11-23 22:48:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490176440] [2019-11-23 22:48:29,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,446 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states. [2019-11-23 22:48:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,584 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions. [2019-11-23 22:48:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,587 INFO L225 Difference]: With dead ends: 828 [2019-11-23 22:48:29,587 INFO L226 Difference]: Without dead ends: 430 [2019-11-23 22:48:29,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-23 22:48:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-11-23 22:48:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-23 22:48:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions. [2019-11-23 22:48:29,608 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100 [2019-11-23 22:48:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,608 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions. [2019-11-23 22:48:29,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions. [2019-11-23 22:48:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:48:29,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,610 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,610 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times [2019-11-23 22:48:29,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212529487] [2019-11-23 22:48:29,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 22:48:29,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212529487] [2019-11-23 22:48:29,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695834801] [2019-11-23 22:48:29,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,645 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states. [2019-11-23 22:48:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,775 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions. [2019-11-23 22:48:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:48:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,778 INFO L225 Difference]: With dead ends: 849 [2019-11-23 22:48:29,778 INFO L226 Difference]: Without dead ends: 430 [2019-11-23 22:48:29,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-23 22:48:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-11-23 22:48:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-23 22:48:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2019-11-23 22:48:29,802 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101 [2019-11-23 22:48:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,803 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2019-11-23 22:48:29,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2019-11-23 22:48:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:48:29,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,806 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times [2019-11-23 22:48:29,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032162259] [2019-11-23 22:48:29,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:29,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032162259] [2019-11-23 22:48:29,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11001818] [2019-11-23 22:48:29,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,886 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states. [2019-11-23 22:48:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,112 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions. [2019-11-23 22:48:30,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:48:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,116 INFO L225 Difference]: With dead ends: 890 [2019-11-23 22:48:30,117 INFO L226 Difference]: Without dead ends: 471 [2019-11-23 22:48:30,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-23 22:48:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2019-11-23 22:48:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-23 22:48:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions. [2019-11-23 22:48:30,153 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102 [2019-11-23 22:48:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,154 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions. [2019-11-23 22:48:30,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions. [2019-11-23 22:48:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:48:30,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,157 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,157 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times [2019-11-23 22:48:30,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125607199] [2019-11-23 22:48:30,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 22:48:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125607199] [2019-11-23 22:48:30,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046411848] [2019-11-23 22:48:30,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,230 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states. [2019-11-23 22:48:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,504 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions. [2019-11-23 22:48:30,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:48:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,509 INFO L225 Difference]: With dead ends: 965 [2019-11-23 22:48:30,509 INFO L226 Difference]: Without dead ends: 504 [2019-11-23 22:48:30,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-23 22:48:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-11-23 22:48:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-23 22:48:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions. [2019-11-23 22:48:30,534 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103 [2019-11-23 22:48:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,535 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions. [2019-11-23 22:48:30,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions. [2019-11-23 22:48:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:48:30,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,538 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,539 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times [2019-11-23 22:48:30,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042025690] [2019-11-23 22:48:30,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 22:48:30,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042025690] [2019-11-23 22:48:30,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185920580] [2019-11-23 22:48:30,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,601 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states. [2019-11-23 22:48:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,837 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions. [2019-11-23 22:48:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:48:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,842 INFO L225 Difference]: With dead ends: 1004 [2019-11-23 22:48:30,842 INFO L226 Difference]: Without dead ends: 507 [2019-11-23 22:48:30,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-23 22:48:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-11-23 22:48:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-23 22:48:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions. [2019-11-23 22:48:30,872 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103 [2019-11-23 22:48:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,872 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions. [2019-11-23 22:48:30,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions. [2019-11-23 22:48:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:48:30,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,879 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,879 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times [2019-11-23 22:48:30,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813832511] [2019-11-23 22:48:30,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 22:48:30,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813832511] [2019-11-23 22:48:30,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637711046] [2019-11-23 22:48:30,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,943 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states. [2019-11-23 22:48:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,145 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions. [2019-11-23 22:48:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:48:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,150 INFO L225 Difference]: With dead ends: 1003 [2019-11-23 22:48:31,150 INFO L226 Difference]: Without dead ends: 506 [2019-11-23 22:48:31,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-11-23 22:48:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-11-23 22:48:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-23 22:48:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions. [2019-11-23 22:48:31,173 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104 [2019-11-23 22:48:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,174 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions. [2019-11-23 22:48:31,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions. [2019-11-23 22:48:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 22:48:31,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,176 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,176 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times [2019-11-23 22:48:31,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137077988] [2019-11-23 22:48:31,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-23 22:48:31,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137077988] [2019-11-23 22:48:31,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607734955] [2019-11-23 22:48:31,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,234 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states. [2019-11-23 22:48:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,282 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions. [2019-11-23 22:48:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-23 22:48:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,287 INFO L225 Difference]: With dead ends: 1491 [2019-11-23 22:48:31,288 INFO L226 Difference]: Without dead ends: 994 [2019-11-23 22:48:31,289 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:48:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-23 22:48:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505. [2019-11-23 22:48:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-23 22:48:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2019-11-23 22:48:31,321 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116 [2019-11-23 22:48:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,321 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2019-11-23 22:48:31,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2019-11-23 22:48:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 22:48:31,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,323 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,323 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times [2019-11-23 22:48:31,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285846015] [2019-11-23 22:48:31,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 22:48:31,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285846015] [2019-11-23 22:48:31,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162311392] [2019-11-23 22:48:31,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,422 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states. [2019-11-23 22:48:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,496 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions. [2019-11-23 22:48:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-23 22:48:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,501 INFO L225 Difference]: With dead ends: 1499 [2019-11-23 22:48:31,502 INFO L226 Difference]: Without dead ends: 1001 [2019-11-23 22:48:31,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-11-23 22:48:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-11-23 22:48:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-23 22:48:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions. [2019-11-23 22:48:31,541 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116 [2019-11-23 22:48:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,542 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions. [2019-11-23 22:48:31,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions. [2019-11-23 22:48:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 22:48:31,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,544 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,545 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times [2019-11-23 22:48:31,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542916511] [2019-11-23 22:48:31,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-23 22:48:31,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542916511] [2019-11-23 22:48:31,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423455938] [2019-11-23 22:48:31,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,623 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states. [2019-11-23 22:48:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,749 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions. [2019-11-23 22:48:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-23 22:48:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,760 INFO L225 Difference]: With dead ends: 2493 [2019-11-23 22:48:31,760 INFO L226 Difference]: Without dead ends: 1499 [2019-11-23 22:48:31,762 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:48:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-11-23 22:48:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-11-23 22:48:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-11-23 22:48:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions. [2019-11-23 22:48:31,846 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118 [2019-11-23 22:48:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,847 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions. [2019-11-23 22:48:31,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions. [2019-11-23 22:48:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 22:48:31,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,850 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,850 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times [2019-11-23 22:48:31,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618069076] [2019-11-23 22:48:31,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-23 22:48:31,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618069076] [2019-11-23 22:48:31,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449823766] [2019-11-23 22:48:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,919 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states. [2019-11-23 22:48:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,024 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions. [2019-11-23 22:48:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 22:48:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,034 INFO L225 Difference]: With dead ends: 1997 [2019-11-23 22:48:32,034 INFO L226 Difference]: Without dead ends: 1995 [2019-11-23 22:48:32,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-11-23 22:48:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2019-11-23 22:48:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-11-23 22:48:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions. [2019-11-23 22:48:32,135 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119 [2019-11-23 22:48:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions. [2019-11-23 22:48:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions. [2019-11-23 22:48:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:48:32,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,140 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:32,140 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times [2019-11-23 22:48:32,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201370265] [2019-11-23 22:48:32,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-23 22:48:32,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201370265] [2019-11-23 22:48:32,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:32,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086536861] [2019-11-23 22:48:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,226 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states. [2019-11-23 22:48:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,438 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions. [2019-11-23 22:48:32,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:48:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,449 INFO L225 Difference]: With dead ends: 4167 [2019-11-23 22:48:32,449 INFO L226 Difference]: Without dead ends: 2181 [2019-11-23 22:48:32,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-11-23 22:48:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157. [2019-11-23 22:48:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-11-23 22:48:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions. [2019-11-23 22:48:32,533 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149 [2019-11-23 22:48:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,534 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions. [2019-11-23 22:48:32,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions. [2019-11-23 22:48:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:48:32,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:32,538 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times [2019-11-23 22:48:32,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950025189] [2019-11-23 22:48:32,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-23 22:48:32,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950025189] [2019-11-23 22:48:32,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:32,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777890608] [2019-11-23 22:48:32,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,591 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states. [2019-11-23 22:48:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,788 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions. [2019-11-23 22:48:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:48:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,798 INFO L225 Difference]: With dead ends: 4331 [2019-11-23 22:48:32,798 INFO L226 Difference]: Without dead ends: 2149 [2019-11-23 22:48:32,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2019-11-23 22:48:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125. [2019-11-23 22:48:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-23 22:48:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions. [2019-11-23 22:48:32,902 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150 [2019-11-23 22:48:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,903 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions. [2019-11-23 22:48:32,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions. [2019-11-23 22:48:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 22:48:32,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,908 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:32,908 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times [2019-11-23 22:48:32,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412633652] [2019-11-23 22:48:32,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-23 22:48:33,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412633652] [2019-11-23 22:48:33,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902186484] [2019-11-23 22:48:33,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:33,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-23 22:48:33,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:33,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:33,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635441176] [2019-11-23 22:48:33,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:33,219 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 3 states. [2019-11-23 22:48:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,403 INFO L93 Difference]: Finished difference Result 4774 states and 7050 transitions. [2019-11-23 22:48:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-23 22:48:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,421 INFO L225 Difference]: With dead ends: 4774 [2019-11-23 22:48:33,422 INFO L226 Difference]: Without dead ends: 2656 [2019-11-23 22:48:33,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-11-23 22:48:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654. [2019-11-23 22:48:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-11-23 22:48:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3900 transitions. [2019-11-23 22:48:33,596 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3900 transitions. Word has length 182 [2019-11-23 22:48:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,597 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 3900 transitions. [2019-11-23 22:48:33,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3900 transitions. [2019-11-23 22:48:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 22:48:33,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,607 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:33,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:33,815 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times [2019-11-23 22:48:33,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568427001] [2019-11-23 22:48:33,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 22:48:33,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568427001] [2019-11-23 22:48:33,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:33,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:33,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254499156] [2019-11-23 22:48:33,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,974 INFO L87 Difference]: Start difference. First operand 2654 states and 3900 transitions. Second operand 3 states. [2019-11-23 22:48:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,226 INFO L93 Difference]: Finished difference Result 4243 states and 6236 transitions. [2019-11-23 22:48:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:34,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 22:48:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,245 INFO L225 Difference]: With dead ends: 4243 [2019-11-23 22:48:34,245 INFO L226 Difference]: Without dead ends: 3183 [2019-11-23 22:48:34,249 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:48:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2019-11-23 22:48:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2019-11-23 22:48:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-23 22:48:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4680 transitions. [2019-11-23 22:48:34,452 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4680 transitions. Word has length 186 [2019-11-23 22:48:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,453 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4680 transitions. [2019-11-23 22:48:34,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4680 transitions. [2019-11-23 22:48:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-23 22:48:34,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,472 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:34,472 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times [2019-11-23 22:48:34,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709877985] [2019-11-23 22:48:34,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-23 22:48:34,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709877985] [2019-11-23 22:48:34,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:34,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:34,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155600761] [2019-11-23 22:48:34,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:34,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:34,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:34,610 INFO L87 Difference]: Start difference. First operand 3183 states and 4680 transitions. Second operand 3 states. [2019-11-23 22:48:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,913 INFO L93 Difference]: Finished difference Result 6419 states and 9421 transitions. [2019-11-23 22:48:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:34,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-11-23 22:48:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,942 INFO L225 Difference]: With dead ends: 6419 [2019-11-23 22:48:34,942 INFO L226 Difference]: Without dead ends: 3243 [2019-11-23 22:48:34,949 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:48:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-11-23 22:48:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3183. [2019-11-23 22:48:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-23 22:48:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4632 transitions. [2019-11-23 22:48:35,109 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4632 transitions. Word has length 264 [2019-11-23 22:48:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:35,109 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4632 transitions. [2019-11-23 22:48:35,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4632 transitions. [2019-11-23 22:48:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-23 22:48:35,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:35,118 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:35,119 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times [2019-11-23 22:48:35,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:35,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311062256] [2019-11-23 22:48:35,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-23 22:48:35,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311062256] [2019-11-23 22:48:35,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:35,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:35,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133513239] [2019-11-23 22:48:35,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:35,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:35,234 INFO L87 Difference]: Start difference. First operand 3183 states and 4632 transitions. Second operand 3 states. [2019-11-23 22:48:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:35,514 INFO L93 Difference]: Finished difference Result 6455 states and 9367 transitions. [2019-11-23 22:48:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:35,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-23 22:48:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:35,526 INFO L225 Difference]: With dead ends: 6455 [2019-11-23 22:48:35,526 INFO L226 Difference]: Without dead ends: 3279 [2019-11-23 22:48:35,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2019-11-23 22:48:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3183. [2019-11-23 22:48:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-23 22:48:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4416 transitions. [2019-11-23 22:48:35,709 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4416 transitions. Word has length 268 [2019-11-23 22:48:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:35,710 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4416 transitions. [2019-11-23 22:48:35,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4416 transitions. [2019-11-23 22:48:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-23 22:48:35,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:35,721 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:35,721 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times [2019-11-23 22:48:35,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:35,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685627323] [2019-11-23 22:48:35,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-11-23 22:48:35,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685627323] [2019-11-23 22:48:35,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:35,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:35,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12028140] [2019-11-23 22:48:35,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:35,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:35,928 INFO L87 Difference]: Start difference. First operand 3183 states and 4416 transitions. Second operand 3 states. [2019-11-23 22:48:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:36,208 INFO L93 Difference]: Finished difference Result 6437 states and 8913 transitions. [2019-11-23 22:48:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:36,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-23 22:48:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:36,216 INFO L225 Difference]: With dead ends: 6437 [2019-11-23 22:48:36,217 INFO L226 Difference]: Without dead ends: 3261 [2019-11-23 22:48:36,224 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:48:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2019-11-23 22:48:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3183. [2019-11-23 22:48:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-23 22:48:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4260 transitions. [2019-11-23 22:48:36,336 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4260 transitions. Word has length 278 [2019-11-23 22:48:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:36,336 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4260 transitions. [2019-11-23 22:48:36,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4260 transitions. [2019-11-23 22:48:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-23 22:48:36,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:36,345 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:36,345 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158541, now seen corresponding path program 1 times [2019-11-23 22:48:36,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:36,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429626739] [2019-11-23 22:48:36,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-23 22:48:36,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429626739] [2019-11-23 22:48:36,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282709692] [2019-11-23 22:48:36,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:36,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:36,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-11-23 22:48:36,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:36,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:36,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633049751] [2019-11-23 22:48:36,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:36,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:36,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:36,864 INFO L87 Difference]: Start difference. First operand 3183 states and 4260 transitions. Second operand 3 states. [2019-11-23 22:48:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:37,107 INFO L93 Difference]: Finished difference Result 9373 states and 12524 transitions. [2019-11-23 22:48:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:37,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-23 22:48:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:37,128 INFO L225 Difference]: With dead ends: 9373 [2019-11-23 22:48:37,129 INFO L226 Difference]: Without dead ends: 6197 [2019-11-23 22:48:37,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-11-23 22:48:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6195. [2019-11-23 22:48:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6195 states. [2019-11-23 22:48:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6195 states to 6195 states and 8256 transitions. [2019-11-23 22:48:37,357 INFO L78 Accepts]: Start accepts. Automaton has 6195 states and 8256 transitions. Word has length 288 [2019-11-23 22:48:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:37,358 INFO L462 AbstractCegarLoop]: Abstraction has 6195 states and 8256 transitions. [2019-11-23 22:48:37,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6195 states and 8256 transitions. [2019-11-23 22:48:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-23 22:48:37,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:37,371 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:37,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:37,575 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2096858319, now seen corresponding path program 1 times [2019-11-23 22:48:37,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:37,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342855669] [2019-11-23 22:48:37,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-23 22:48:37,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342855669] [2019-11-23 22:48:37,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412437645] [2019-11-23 22:48:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:37,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:37,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-23 22:48:37,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:37,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:37,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797297227] [2019-11-23 22:48:37,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:37,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:37,987 INFO L87 Difference]: Start difference. First operand 6195 states and 8256 transitions. Second operand 4 states. [2019-11-23 22:48:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:38,596 INFO L93 Difference]: Finished difference Result 17795 states and 23500 transitions. [2019-11-23 22:48:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:38,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-11-23 22:48:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:38,620 INFO L225 Difference]: With dead ends: 17795 [2019-11-23 22:48:38,620 INFO L226 Difference]: Without dead ends: 11451 [2019-11-23 22:48:38,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states. [2019-11-23 22:48:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 6339. [2019-11-23 22:48:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-11-23 22:48:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 8448 transitions. [2019-11-23 22:48:38,956 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 8448 transitions. Word has length 288 [2019-11-23 22:48:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:38,956 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 8448 transitions. [2019-11-23 22:48:38,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 8448 transitions. [2019-11-23 22:48:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-23 22:48:38,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:38,972 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:39,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:39,172 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times [2019-11-23 22:48:39,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:39,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056350165] [2019-11-23 22:48:39,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-23 22:48:39,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056350165] [2019-11-23 22:48:39,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276886813] [2019-11-23 22:48:39,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:39,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:39,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-23 22:48:39,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104782750] [2019-11-23 22:48:39,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:39,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:39,437 INFO L87 Difference]: Start difference. First operand 6339 states and 8448 transitions. Second operand 4 states. [2019-11-23 22:48:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:39,917 INFO L93 Difference]: Finished difference Result 14214 states and 18779 transitions. [2019-11-23 22:48:39,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:39,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-11-23 22:48:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:39,934 INFO L225 Difference]: With dead ends: 14214 [2019-11-23 22:48:39,934 INFO L226 Difference]: Without dead ends: 7852 [2019-11-23 22:48:39,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2019-11-23 22:48:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 6153. [2019-11-23 22:48:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-11-23 22:48:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8148 transitions. [2019-11-23 22:48:40,237 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8148 transitions. Word has length 297 [2019-11-23 22:48:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:40,237 INFO L462 AbstractCegarLoop]: Abstraction has 6153 states and 8148 transitions. [2019-11-23 22:48:40,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8148 transitions. [2019-11-23 22:48:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-23 22:48:40,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:40,250 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:40,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:40,455 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash -231299850, now seen corresponding path program 1 times [2019-11-23 22:48:40,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:40,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517140220] [2019-11-23 22:48:40,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-11-23 22:48:40,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517140220] [2019-11-23 22:48:40,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:40,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:40,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177122675] [2019-11-23 22:48:40,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:40,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:40,549 INFO L87 Difference]: Start difference. First operand 6153 states and 8148 transitions. Second operand 3 states. [2019-11-23 22:48:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:40,855 INFO L93 Difference]: Finished difference Result 12695 states and 16825 transitions. [2019-11-23 22:48:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:40,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-11-23 22:48:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:40,869 INFO L225 Difference]: With dead ends: 12695 [2019-11-23 22:48:40,870 INFO L226 Difference]: Without dead ends: 6333 [2019-11-23 22:48:40,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2019-11-23 22:48:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 6333. [2019-11-23 22:48:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-11-23 22:48:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 8322 transitions. [2019-11-23 22:48:41,079 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 8322 transitions. Word has length 306 [2019-11-23 22:48:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:41,079 INFO L462 AbstractCegarLoop]: Abstraction has 6333 states and 8322 transitions. [2019-11-23 22:48:41,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 8322 transitions. [2019-11-23 22:48:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-11-23 22:48:41,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:41,094 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:41,094 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash -707716365, now seen corresponding path program 1 times [2019-11-23 22:48:41,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:41,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475247623] [2019-11-23 22:48:41,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-23 22:48:41,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475247623] [2019-11-23 22:48:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097757087] [2019-11-23 22:48:41,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:41,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:41,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-23 22:48:41,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:41,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:41,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155642238] [2019-11-23 22:48:41,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:41,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:41,509 INFO L87 Difference]: Start difference. First operand 6333 states and 8322 transitions. Second operand 4 states. [2019-11-23 22:48:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:42,019 INFO L93 Difference]: Finished difference Result 13044 states and 16947 transitions. [2019-11-23 22:48:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:42,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-11-23 22:48:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:42,034 INFO L225 Difference]: With dead ends: 13044 [2019-11-23 22:48:42,034 INFO L226 Difference]: Without dead ends: 6718 [2019-11-23 22:48:42,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2019-11-23 22:48:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 4032. [2019-11-23 22:48:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-23 22:48:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5147 transitions. [2019-11-23 22:48:42,189 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5147 transitions. Word has length 318 [2019-11-23 22:48:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:42,189 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5147 transitions. [2019-11-23 22:48:42,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5147 transitions. [2019-11-23 22:48:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-23 22:48:42,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:42,200 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:42,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:42,410 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times [2019-11-23 22:48:42,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006853492] [2019-11-23 22:48:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-23 22:48:42,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006853492] [2019-11-23 22:48:42,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:42,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:42,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723718019] [2019-11-23 22:48:42,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:42,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:42,643 INFO L87 Difference]: Start difference. First operand 4032 states and 5147 transitions. Second operand 3 states. [2019-11-23 22:48:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:42,895 INFO L93 Difference]: Finished difference Result 8177 states and 10418 transitions. [2019-11-23 22:48:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:42,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-23 22:48:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:42,904 INFO L225 Difference]: With dead ends: 8177 [2019-11-23 22:48:42,904 INFO L226 Difference]: Without dead ends: 4152 [2019-11-23 22:48:42,909 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:48:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-11-23 22:48:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4032. [2019-11-23 22:48:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-23 22:48:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5069 transitions. [2019-11-23 22:48:43,059 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5069 transitions. Word has length 321 [2019-11-23 22:48:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5069 transitions. [2019-11-23 22:48:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5069 transitions. [2019-11-23 22:48:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-23 22:48:43,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:43,068 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:43,068 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1605204832, now seen corresponding path program 1 times [2019-11-23 22:48:43,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:43,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538088578] [2019-11-23 22:48:43,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-23 22:48:43,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538088578] [2019-11-23 22:48:43,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:43,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:43,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820522044] [2019-11-23 22:48:43,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:43,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:43,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:43,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:43,186 INFO L87 Difference]: Start difference. First operand 4032 states and 5069 transitions. Second operand 3 states. [2019-11-23 22:48:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:43,445 INFO L93 Difference]: Finished difference Result 7108 states and 8996 transitions. [2019-11-23 22:48:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:43,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-11-23 22:48:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:43,456 INFO L225 Difference]: With dead ends: 7108 [2019-11-23 22:48:43,457 INFO L226 Difference]: Without dead ends: 4088 [2019-11-23 22:48:43,466 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:48:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-11-23 22:48:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4032. [2019-11-23 22:48:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-23 22:48:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5063 transitions. [2019-11-23 22:48:43,650 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5063 transitions. Word has length 364 [2019-11-23 22:48:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:43,651 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5063 transitions. [2019-11-23 22:48:43,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5063 transitions. [2019-11-23 22:48:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-23 22:48:43,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:43,660 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:43,660 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times [2019-11-23 22:48:43,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:43,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673108522] [2019-11-23 22:48:43,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-23 22:48:43,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673108522] [2019-11-23 22:48:43,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:43,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:43,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397811917] [2019-11-23 22:48:43,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:43,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:43,889 INFO L87 Difference]: Start difference. First operand 4032 states and 5063 transitions. Second operand 3 states. [2019-11-23 22:48:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:44,185 INFO L93 Difference]: Finished difference Result 7064 states and 8910 transitions. [2019-11-23 22:48:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:44,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-11-23 22:48:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:44,196 INFO L225 Difference]: With dead ends: 7064 [2019-11-23 22:48:44,196 INFO L226 Difference]: Without dead ends: 4044 [2019-11-23 22:48:44,200 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:48:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2019-11-23 22:48:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 4032. [2019-11-23 22:48:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-23 22:48:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5057 transitions. [2019-11-23 22:48:44,349 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5057 transitions. Word has length 387 [2019-11-23 22:48:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:44,350 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5057 transitions. [2019-11-23 22:48:44,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5057 transitions. [2019-11-23 22:48:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-23 22:48:44,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:44,357 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:44,357 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times [2019-11-23 22:48:44,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:44,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020563122] [2019-11-23 22:48:44,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-23 22:48:44,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020563122] [2019-11-23 22:48:44,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:44,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:44,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088403276] [2019-11-23 22:48:44,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:44,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:44,480 INFO L87 Difference]: Start difference. First operand 4032 states and 5057 transitions. Second operand 3 states. [2019-11-23 22:48:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:44,671 INFO L93 Difference]: Finished difference Result 7517 states and 9443 transitions. [2019-11-23 22:48:44,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:44,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-11-23 22:48:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:44,678 INFO L225 Difference]: With dead ends: 7517 [2019-11-23 22:48:44,678 INFO L226 Difference]: Without dead ends: 3371 [2019-11-23 22:48:44,681 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:48:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-11-23 22:48:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3282. [2019-11-23 22:48:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-11-23 22:48:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4095 transitions. [2019-11-23 22:48:44,809 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4095 transitions. Word has length 387 [2019-11-23 22:48:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:44,809 INFO L462 AbstractCegarLoop]: Abstraction has 3282 states and 4095 transitions. [2019-11-23 22:48:44,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4095 transitions. [2019-11-23 22:48:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-23 22:48:44,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:44,821 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:44,821 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times [2019-11-23 22:48:44,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:44,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752930606] [2019-11-23 22:48:44,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-23 22:48:45,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752930606] [2019-11-23 22:48:45,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491571860] [2019-11-23 22:48:45,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:45,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:45,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-23 22:48:45,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:45,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:45,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681565353] [2019-11-23 22:48:45,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:45,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:45,498 INFO L87 Difference]: Start difference. First operand 3282 states and 4095 transitions. Second operand 4 states. [2019-11-23 22:48:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:45,785 INFO L93 Difference]: Finished difference Result 5377 states and 6760 transitions. [2019-11-23 22:48:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:45,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-23 22:48:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:45,786 INFO L225 Difference]: With dead ends: 5377 [2019-11-23 22:48:45,786 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:45,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:45,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2019-11-23 22:48:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:45,793 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:45,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:45,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:45,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:46,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:46,125 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2019-11-23 22:48:46,234 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-11-23 22:48:46,375 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-11-23 22:48:46,562 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 155 [2019-11-23 22:48:48,149 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-11-23 22:48:49,385 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-11-23 22:48:50,349 WARN L192 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2019-11-23 22:48:51,095 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-11-23 22:48:51,576 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 21 [2019-11-23 22:48:52,354 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 21 [2019-11-23 22:48:52,785 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-11-23 22:48:58,561 WARN L192 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 361 DAG size of output: 107 [2019-11-23 22:48:59,007 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-23 22:48:59,643 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-23 22:49:00,111 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 23 [2019-11-23 22:49:00,362 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2019-11-23 22:49:01,063 WARN L192 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2019-11-23 22:49:06,362 WARN L192 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 361 DAG size of output: 107 [2019-11-23 22:49:06,770 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 29 [2019-11-23 22:49:07,343 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-11-23 22:49:07,965 WARN L192 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-23 22:49:08,394 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-11-23 22:49:08,908 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 28 [2019-11-23 22:49:09,336 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-11-23 22:49:09,799 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-23 22:49:10,389 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-23 22:49:10,957 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-11-23 22:49:10,961 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 602) no Hoare annotation was computed. [2019-11-23 22:49:10,961 INFO L444 ceAbstractionStarter]: For program point L597-2(lines 596 610) no Hoare annotation was computed. [2019-11-23 22:49:10,962 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-23 22:49:10,962 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse1) (and .cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2))) [2019-11-23 22:49:10,962 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 594) the Hoare annotation is: false [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 601) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 442) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 372) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L335-1(lines 335 372) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 560) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 571) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 582) no Hoare annotation was computed. [2019-11-23 22:49:10,963 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 593) no Hoare annotation was computed. [2019-11-23 22:49:10,964 INFO L440 ceAbstractionStarter]: At program point L402(lines 393 414) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:49:10,964 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 369) no Hoare annotation was computed. [2019-11-23 22:49:10,964 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 313) no Hoare annotation was computed. [2019-11-23 22:49:10,964 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 313) no Hoare annotation was computed. [2019-11-23 22:49:10,964 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-11-23 22:49:10,965 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 572) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse7 .cse8 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse4 .cse6 .cse9))) [2019-11-23 22:49:10,965 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-23 22:49:10,965 INFO L444 ceAbstractionStarter]: For program point L535(lines 535 539) no Hoare annotation was computed. [2019-11-23 22:49:10,965 INFO L444 ceAbstractionStarter]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2019-11-23 22:49:10,965 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 440) no Hoare annotation was computed. [2019-11-23 22:49:10,965 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 570) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 581) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 592) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L447 ceAbstractionStarter]: At program point L636(lines 627 638) the Hoare annotation is: true [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,966 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 608) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 305 313) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 367) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 569) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 580) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 591) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed. [2019-11-23 22:49:10,967 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-23 22:49:10,968 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-11-23 22:49:10,968 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-23 22:49:10,968 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 593) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-11-23 22:49:10,968 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 570) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19 .cse18 .cse20 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse14 .cse16 .cse21))) [2019-11-23 22:49:10,969 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 581) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L344-2(lines 344 348) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 568) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 579) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 590) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,969 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 551) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L545-1(lines 545 551) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 567) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 578) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 589) no Hoare annotation was computed. [2019-11-23 22:49:10,970 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 416) no Hoare annotation was computed. [2019-11-23 22:49:10,971 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8))) [2019-11-23 22:49:10,971 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-23 22:49:10,971 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-23 22:49:10,971 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:49:10,971 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 450) no Hoare annotation was computed. [2019-11-23 22:49:10,971 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 388) no Hoare annotation was computed. [2019-11-23 22:49:10,978 INFO L447 ceAbstractionStarter]: At program point L614(lines 97 615) the Hoare annotation is: true [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 566) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 577) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 588) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 485) no Hoare annotation was computed. [2019-11-23 22:49:10,979 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 589) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-23 22:49:10,980 INFO L440 ceAbstractionStarter]: At program point L484(lines 71 625) the Hoare annotation is: false [2019-11-23 22:49:10,980 INFO L444 ceAbstractionStarter]: For program point L451(lines 451 460) no Hoare annotation was computed. [2019-11-23 22:49:10,980 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 363) no Hoare annotation was computed. [2019-11-23 22:49:10,980 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-23 22:49:10,980 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:49:10,980 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,980 INFO L440 ceAbstractionStarter]: At program point L353(lines 329 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 565) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 576) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 587) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 625) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 488) no Hoare annotation was computed. [2019-11-23 22:49:10,981 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse4) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 .cse0 .cse1))) [2019-11-23 22:49:10,982 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:49:10,982 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 587) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:49:10,982 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-23 22:49:10,982 INFO L444 ceAbstractionStarter]: For program point L619(lines 619 621) no Hoare annotation was computed. [2019-11-23 22:49:10,982 INFO L444 ceAbstractionStarter]: For program point L619-2(lines 619 621) no Hoare annotation was computed. [2019-11-23 22:49:10,982 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed. [2019-11-23 22:49:10,982 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L355-2(lines 352 361) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 564) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 575) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 586) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-23 22:49:10,983 INFO L444 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L440 ceAbstractionStarter]: At program point L390(lines 381 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-23 22:49:10,984 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 563) no Hoare annotation was computed. [2019-11-23 22:49:10,985 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 574) no Hoare annotation was computed. [2019-11-23 22:49:10,985 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 585) no Hoare annotation was computed. [2019-11-23 22:49:10,985 INFO L447 ceAbstractionStarter]: At program point L624(lines 10 626) the Hoare annotation is: true [2019-11-23 22:49:10,985 INFO L440 ceAbstractionStarter]: At program point L558(lines 98 613) the Hoare annotation is: (let ((.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse17 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse20 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0) (and .cse1 .cse16 .cse17 .cse7) (and .cse1 .cse16 .cse18) (and .cse8 .cse19 .cse17 .cse10 .cse12 .cse13 .cse14 .cse15 .cse7) (and .cse20 .cse21 .cse18 .cse6 .cse22) (and .cse20 .cse18 .cse6 .cse12 .cse4) (and .cse19 .cse17 .cse23 .cse21 .cse15 .cse7 .cse8 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse5 .cse19 .cse17 .cse7) (and .cse0 .cse8 .cse24 .cse25 .cse26 .cse27 .cse21 .cse23 .cse28 .cse29 .cse15 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse21 .cse22 .cse7) (and .cse1 .cse19 .cse2 .cse3 .cse17 .cse4 .cse7) (and .cse1 .cse16 .cse6 .cse7) (and .cse0 .cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse11 .cse15 .cse8 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse19 .cse17 .cse28 .cse7) (and .cse1 .cse2 .cse3 .cse18 .cse6 .cse4 .cse7) (and .cse0 .cse30 .cse28 .cse7) (and .cse5 .cse20 .cse18 .cse6))) [2019-11-23 22:49:10,985 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-11-23 22:49:10,985 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 414) no Hoare annotation was computed. [2019-11-23 22:49:10,986 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 .cse4 .cse5))) [2019-11-23 22:49:10,986 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:49:10,986 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 400) no Hoare annotation was computed. [2019-11-23 22:49:10,986 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 562) no Hoare annotation was computed. [2019-11-23 22:49:10,986 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 573) no Hoare annotation was computed. [2019-11-23 22:49:10,986 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 584) no Hoare annotation was computed. [2019-11-23 22:49:10,987 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 613) the Hoare annotation is: (let ((.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse17 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse20 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0) (and .cse1 .cse16 .cse17 .cse7) (and .cse1 .cse16 .cse18) (and .cse8 .cse19 .cse17 .cse10 .cse12 .cse13 .cse14 .cse15 .cse7) (and .cse20 .cse21 .cse18 .cse6 .cse22) (and .cse20 .cse18 .cse6 .cse12 .cse4) (and .cse19 .cse17 .cse23 .cse21 .cse15 .cse7 .cse8 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse5 .cse19 .cse17 .cse7) (and .cse0 .cse8 .cse24 .cse25 .cse26 .cse27 .cse21 .cse23 .cse28 .cse29 .cse15 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse21 .cse22 .cse7) (and .cse1 .cse19 .cse2 .cse3 .cse17 .cse4 .cse7) (and .cse1 .cse16 .cse6 .cse7) (and .cse0 .cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse11 .cse15 .cse8 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse19 .cse17 .cse28 .cse7) (and .cse1 .cse2 .cse3 .cse18 .cse6 .cse4 .cse7) (and .cse0 .cse30 .cse28 .cse7) (and .cse5 .cse20 .cse18 .cse6))) [2019-11-23 22:49:10,987 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2019-11-23 22:49:10,987 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 530) no Hoare annotation was computed. [2019-11-23 22:49:10,987 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 207 557) no Hoare annotation was computed. [2019-11-23 22:49:10,987 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-23 22:49:10,988 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 573) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2))) [2019-11-23 22:49:10,988 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 586) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-23 22:49:10,988 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 22:49:10,988 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 611) no Hoare annotation was computed. [2019-11-23 22:49:10,988 INFO L444 ceAbstractionStarter]: For program point L596(lines 596 610) no Hoare annotation was computed. [2019-11-23 22:49:10,988 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 373) no Hoare annotation was computed. [2019-11-23 22:49:10,988 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 561) no Hoare annotation was computed. [2019-11-23 22:49:10,989 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 572) no Hoare annotation was computed. [2019-11-23 22:49:10,989 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 583) no Hoare annotation was computed. [2019-11-23 22:49:10,989 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 594) no Hoare annotation was computed. [2019-11-23 22:49:11,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:49:11 BoogieIcfgContainer [2019-11-23 22:49:11,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:49:11,053 INFO L168 Benchmark]: Toolchain (without parser) took 47694.17 ms. Allocated memory was 145.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.0 MB in the beginning and 617.4 MB in the end (delta: -514.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,053 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.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:49:11,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 177.7 MB in the end (delta: -75.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.48 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 174.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,054 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 202.4 MB. Free memory was 174.3 MB in the beginning and 172.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,054 INFO L168 Benchmark]: RCFGBuilder took 951.45 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 117.2 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,055 INFO L168 Benchmark]: TraceAbstraction took 46092.40 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 116.5 MB in the beginning and 617.4 MB in the end (delta: -500.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-11-23 22:49:11,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 535.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 177.7 MB in the end (delta: -75.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.48 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 174.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.82 ms. Allocated memory is still 202.4 MB. Free memory was 174.3 MB in the beginning and 172.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 951.45 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 117.2 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46092.40 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 116.5 MB in the beginning and 617.4 MB in the end (delta: -500.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 623]: 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: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && 8544 <= s__state) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8640)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8641)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8496)) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit) || ((((!(s__state == 8448) && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8448) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 4) && !(s__state == 12292)) || (((8672 <= s__state && 6 <= blastFlag) && !(s__state == 12292)) && 0 == s__hit)) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8641)) && 8640 <= s__state) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545))) || (s__state <= 3 && blastFlag <= 2)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((s__state <= 8672 && 8672 <= s__state) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 3 && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8657)) && !(s__state == 8641)) && 6 <= blastFlag) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8641)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8592)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) || (((((((((((((!(s__state == 8608) && !(s__state == 8592)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8544) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || (((((blastFlag <= 2 && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && blastFlag <= 2) && !(s__state == 8641)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8640)) || (((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8641)) && 6 <= blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8640)) && 0 == s__hit)) || (((((((s__state <= 8672 && !(s__state == 8641)) && !(s__state == 8672)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__state == 8640)) && 0 == s__hit) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8641)) && 8640 <= s__state) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545))) || (s__state <= 3 && blastFlag <= 2)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((s__state <= 8672 && 8672 <= s__state) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 3 && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8657)) && !(s__state == 8641)) && 6 <= blastFlag) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8641)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) || ((((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) && 0 == s__hit)) || ((((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 8640) && 8640 <= s__state) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8592)) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8592)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8560)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: SAFE, OverallTime: 45.9s, OverallIterations: 43, TraceHistogramMax: 14, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.9s, HoareTripleCheckerStatistics: 7875 SDtfs, 6018 SDslu, 3426 SDs, 0 SdLazy, 4127 SolverSat, 1427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1852 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6339occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 10655 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 263 NumberOfFragments, 2635 HoareAnnotationTreeSize, 28 FomulaSimplifications, 400389 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 109652 FormulaSimplificationTreeSizeReductionInter, 21.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 8758 NumberOfCodeBlocks, 8758 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 8709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026590 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3004 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 49 InterpolantComputations, 39 PerfectInterpolantSequences, 21964/22196 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...