/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_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:28,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:28,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:28,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:28,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:28,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:28,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:28,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:28,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:28,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:28,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:28,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:28,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:28,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:28,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:28,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:28,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:28,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:28,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:28,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:28,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:28,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:28,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:28,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:28,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:28,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:28,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:28,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:28,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:28,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:28,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:28,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:28,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:28,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:28,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:28,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:28,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:28,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:28,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:28,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:28,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:28,363 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:47:28,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:28,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:28,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:28,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:28,379 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:28,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:28,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:28,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:28,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:28,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:28,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:28,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:28,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:28,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:28,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:28,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:28,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:28,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:28,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:28,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:28,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:28,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:28,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:28,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:28,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:28,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:28,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:28,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:28,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:28,684 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:28,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-23 22:47:28,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01c98745/709b04e96e9b49958bcbc953eb085fa5/FLAGfdf2e476e [2019-11-23 22:47:29,233 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:29,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-23 22:47:29,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01c98745/709b04e96e9b49958bcbc953eb085fa5/FLAGfdf2e476e [2019-11-23 22:47:29,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01c98745/709b04e96e9b49958bcbc953eb085fa5 [2019-11-23 22:47:29,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:29,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:29,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:29,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:29,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:29,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:29" (1/1) ... [2019-11-23 22:47:29,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2205d9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:29, skipping insertion in model container [2019-11-23 22:47:29,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:29" (1/1) ... [2019-11-23 22:47:29,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:29,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:29,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:29,925 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:30,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:30,081 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:30,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30 WrapperNode [2019-11-23 22:47:30,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:30,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:30,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:30,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:30,092 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:47:30" (1/1) ... [2019-11-23 22:47:30,103 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:47:30" (1/1) ... [2019-11-23 22:47:30,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:30,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:30,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:30,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:30,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (1/1) ... [2019-11-23 22:47:30,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:30,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:30,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:30,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:30,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (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:47:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:30,399 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:31,043 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:47:31,043 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:47:31,044 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:31,045 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:31 BoogieIcfgContainer [2019-11-23 22:47:31,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:31,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:31,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:31,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:31,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:29" (1/3) ... [2019-11-23 22:47:31,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c9c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:31, skipping insertion in model container [2019-11-23 22:47:31,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:30" (2/3) ... [2019-11-23 22:47:31,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c9c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:31, skipping insertion in model container [2019-11-23 22:47:31,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:31" (3/3) ... [2019-11-23 22:47:31,055 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-23 22:47:31,065 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:31,073 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:31,085 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:31,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:31,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:31,112 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:31,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:31,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:31,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:31,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:31,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-23 22:47:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:47:31,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:31,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:31,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-23 22:47:31,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:31,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113451869] [2019-11-23 22:47:31,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:31,383 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:47:31,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113451869] [2019-11-23 22:47:31,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:31,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:31,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407882352] [2019-11-23 22:47:31,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:31,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:31,414 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-23 22:47:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:31,699 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-23 22:47:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:31,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:47:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:31,712 INFO L225 Difference]: With dead ends: 251 [2019-11-23 22:47:31,712 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:47:31,716 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:47:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:47:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-23 22:47:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:47:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-23 22:47:31,763 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-23 22:47:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:31,764 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-23 22:47:31,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-23 22:47:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:47:31,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:31,767 INFO L410 BasicCegarLoop]: trace histogram [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:47:31,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-23 22:47:31,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:31,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773951975] [2019-11-23 22:47:31,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:31,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773951975] [2019-11-23 22:47:31,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:31,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107034842] [2019-11-23 22:47:31,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:31,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:31,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:31,868 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-23 22:47:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:32,039 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-11-23 22:47:32,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:32,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:47:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:32,042 INFO L225 Difference]: With dead ends: 238 [2019-11-23 22:47:32,042 INFO L226 Difference]: Without dead ends: 133 [2019-11-23 22:47:32,043 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:47:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-23 22:47:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-23 22:47:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-23 22:47:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-23 22:47:32,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-23 22:47:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:32,060 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-23 22:47:32,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-23 22:47:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:47:32,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:32,062 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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:47:32,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-11-23 22:47:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:32,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972254019] [2019-11-23 22:47:32,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:47:32,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972254019] [2019-11-23 22:47:32,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:32,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:32,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102613044] [2019-11-23 22:47:32,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:32,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:32,130 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-23 22:47:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:32,288 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-23 22:47:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:32,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:47:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:32,291 INFO L225 Difference]: With dead ends: 270 [2019-11-23 22:47:32,291 INFO L226 Difference]: Without dead ends: 150 [2019-11-23 22:47:32,292 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:47:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-23 22:47:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-23 22:47:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-23 22:47:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-23 22:47:32,304 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-23 22:47:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:32,304 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-23 22:47:32,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-23 22:47:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:32,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:32,306 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:47:32,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-11-23 22:47:32,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:32,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639993817] [2019-11-23 22:47:32,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:32,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639993817] [2019-11-23 22:47:32,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:32,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:32,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548928424] [2019-11-23 22:47:32,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:32,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:32,429 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-23 22:47:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:32,639 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-23 22:47:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:32,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:32,643 INFO L225 Difference]: With dead ends: 334 [2019-11-23 22:47:32,643 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:47:32,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:47:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-23 22:47:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-23 22:47:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-23 22:47:32,660 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-23 22:47:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:32,661 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-23 22:47:32,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-23 22:47:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:32,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:32,663 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:47:32,663 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-11-23 22:47:32,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:32,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481107973] [2019-11-23 22:47:32,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:32,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481107973] [2019-11-23 22:47:32,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:32,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:32,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631392992] [2019-11-23 22:47:32,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:32,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:32,739 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-23 22:47:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:32,866 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-23 22:47:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:32,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:32,868 INFO L225 Difference]: With dead ends: 389 [2019-11-23 22:47:32,869 INFO L226 Difference]: Without dead ends: 211 [2019-11-23 22:47:32,870 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:47:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-23 22:47:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-23 22:47:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-23 22:47:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-23 22:47:32,879 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-23 22:47:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:32,880 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-23 22:47:32,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-23 22:47:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:47:32,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:32,882 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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:47:32,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-11-23 22:47:32,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:32,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586927617] [2019-11-23 22:47:32,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 22:47:32,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586927617] [2019-11-23 22:47:32,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:32,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:32,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770868318] [2019-11-23 22:47:32,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:32,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:32,935 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-23 22:47:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:33,065 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-23 22:47:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:33,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:47:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:33,070 INFO L225 Difference]: With dead ends: 427 [2019-11-23 22:47:33,070 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:47:33,071 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:47:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:47:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-23 22:47:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-23 22:47:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-23 22:47:33,086 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-23 22:47:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:33,087 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-23 22:47:33,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-23 22:47:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:47:33,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:33,091 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 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] [2019-11-23 22:47:33,093 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-11-23 22:47:33,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:33,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666264401] [2019-11-23 22:47:33,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:47:33,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666264401] [2019-11-23 22:47:33,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:33,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:33,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480850476] [2019-11-23 22:47:33,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:33,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:33,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:33,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:33,201 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-23 22:47:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:33,251 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-23 22:47:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:33,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:47:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:33,257 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:47:33,257 INFO L226 Difference]: Without dead ends: 443 [2019-11-23 22:47:33,258 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:47:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-23 22:47:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-23 22:47:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-23 22:47:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-23 22:47:33,275 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-23 22:47:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:33,276 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-23 22:47:33,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-23 22:47:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:47:33,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:33,279 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 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] [2019-11-23 22:47:33,279 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:33,280 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-11-23 22:47:33,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:33,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993466280] [2019-11-23 22:47:33,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 22:47:33,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993466280] [2019-11-23 22:47:33,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:33,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:33,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637942601] [2019-11-23 22:47:33,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:33,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:33,373 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-23 22:47:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:33,421 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-23 22:47:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:33,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:47:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:33,425 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:47:33,425 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 22:47:33,426 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:47:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 22:47:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-23 22:47:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 22:47:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-23 22:47:33,459 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-23 22:47:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:33,459 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-23 22:47:33,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-23 22:47:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 22:47:33,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:33,462 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-11-23 22:47:33,463 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-11-23 22:47:33,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:33,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131121422] [2019-11-23 22:47:33,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-23 22:47:33,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131121422] [2019-11-23 22:47:33,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:33,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:33,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399627314] [2019-11-23 22:47:33,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:33,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:33,528 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-23 22:47:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:33,704 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-23 22:47:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:33,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 22:47:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:33,711 INFO L225 Difference]: With dead ends: 1462 [2019-11-23 22:47:33,711 INFO L226 Difference]: Without dead ends: 809 [2019-11-23 22:47:33,713 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:47:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-23 22:47:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-23 22:47:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-23 22:47:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-23 22:47:33,740 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-11-23 22:47:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:33,741 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-23 22:47:33,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-23 22:47:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:47:33,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:33,745 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2019-11-23 22:47:33,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-11-23 22:47:33,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:33,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361043754] [2019-11-23 22:47:33,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-23 22:47:33,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361043754] [2019-11-23 22:47:33,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:33,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:33,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025327489] [2019-11-23 22:47:33,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:33,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:33,835 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-23 22:47:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:34,013 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-23 22:47:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:34,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 22:47:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:34,019 INFO L225 Difference]: With dead ends: 1824 [2019-11-23 22:47:34,019 INFO L226 Difference]: Without dead ends: 1006 [2019-11-23 22:47:34,021 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:47:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-23 22:47:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-23 22:47:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-23 22:47:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-23 22:47:34,050 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-23 22:47:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:34,050 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-23 22:47:34,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-23 22:47:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 22:47:34,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:34,055 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:34,055 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-11-23 22:47:34,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:34,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778946021] [2019-11-23 22:47:34,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-23 22:47:34,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778946021] [2019-11-23 22:47:34,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:34,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:34,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942424665] [2019-11-23 22:47:34,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:34,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:34,122 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-23 22:47:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:34,331 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-23 22:47:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:34,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-23 22:47:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:34,338 INFO L225 Difference]: With dead ends: 2080 [2019-11-23 22:47:34,338 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:47:34,340 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:47:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:47:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-23 22:47:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-23 22:47:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-23 22:47:34,376 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-23 22:47:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:34,376 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-23 22:47:34,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-23 22:47:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 22:47:34,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:34,382 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:34,382 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-11-23 22:47:34,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:34,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919708003] [2019-11-23 22:47:34,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:34,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919708003] [2019-11-23 22:47:34,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:34,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:34,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842433233] [2019-11-23 22:47:34,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:34,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:34,488 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-23 22:47:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:34,676 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-23 22:47:34,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:34,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-23 22:47:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:34,683 INFO L225 Difference]: With dead ends: 2230 [2019-11-23 22:47:34,683 INFO L226 Difference]: Without dead ends: 1160 [2019-11-23 22:47:34,686 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:47:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-23 22:47:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-23 22:47:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-23 22:47:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-23 22:47:34,722 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-23 22:47:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:34,723 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-23 22:47:34,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-23 22:47:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 22:47:34,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:34,729 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:34,729 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-11-23 22:47:34,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:34,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776324883] [2019-11-23 22:47:34,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:34,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776324883] [2019-11-23 22:47:34,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:34,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:34,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394070304] [2019-11-23 22:47:34,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:34,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:34,826 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-23 22:47:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,011 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-23 22:47:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-23 22:47:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,018 INFO L225 Difference]: With dead ends: 2398 [2019-11-23 22:47:35,018 INFO L226 Difference]: Without dead ends: 1256 [2019-11-23 22:47:35,020 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:47:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-23 22:47:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-23 22:47:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-23 22:47:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-23 22:47:35,056 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-23 22:47:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,056 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-23 22:47:35,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-23 22:47:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 22:47:35,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,062 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 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, 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] [2019-11-23 22:47:35,062 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-11-23 22:47:35,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322337364] [2019-11-23 22:47:35,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-23 22:47:35,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322337364] [2019-11-23 22:47:35,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:35,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742074849] [2019-11-23 22:47:35,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:35,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,164 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-23 22:47:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,229 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-23 22:47:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-23 22:47:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,244 INFO L225 Difference]: With dead ends: 3630 [2019-11-23 22:47:35,244 INFO L226 Difference]: Without dead ends: 2422 [2019-11-23 22:47:35,248 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:47:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-23 22:47:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-23 22:47:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-23 22:47:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-23 22:47:35,353 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-23 22:47:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,354 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-23 22:47:35,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-23 22:47:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 22:47:35,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,368 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 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, 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] [2019-11-23 22:47:35,369 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-11-23 22:47:35,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505697928] [2019-11-23 22:47:35,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-23 22:47:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505697928] [2019-11-23 22:47:35,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:35,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541075489] [2019-11-23 22:47:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:35,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,576 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-23 22:47:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,832 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-23 22:47:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-23 22:47:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,845 INFO L225 Difference]: With dead ends: 5143 [2019-11-23 22:47:35,846 INFO L226 Difference]: Without dead ends: 2702 [2019-11-23 22:47:35,850 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:47:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-23 22:47:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-23 22:47:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-23 22:47:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-23 22:47:35,922 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-23 22:47:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,922 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-23 22:47:35,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-23 22:47:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-23 22:47:35,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,931 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2019-11-23 22:47:35,931 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-11-23 22:47:35,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930501031] [2019-11-23 22:47:35,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-23 22:47:36,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930501031] [2019-11-23 22:47:36,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690953518] [2019-11-23 22:47:36,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,088 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-23 22:47:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,291 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-23 22:47:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-23 22:47:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,305 INFO L225 Difference]: With dead ends: 5335 [2019-11-23 22:47:36,305 INFO L226 Difference]: Without dead ends: 2696 [2019-11-23 22:47:36,310 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:47:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-23 22:47:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-23 22:47:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-23 22:47:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-23 22:47:36,389 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-23 22:47:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,389 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-23 22:47:36,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-23 22:47:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-23 22:47:36,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,398 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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:47:36,398 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-11-23 22:47:36,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913926203] [2019-11-23 22:47:36,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-23 22:47:36,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913926203] [2019-11-23 22:47:36,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411614921] [2019-11-23 22:47:36,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,544 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-23 22:47:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,738 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-23 22:47:36,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-23 22:47:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,750 INFO L225 Difference]: With dead ends: 5299 [2019-11-23 22:47:36,751 INFO L226 Difference]: Without dead ends: 2684 [2019-11-23 22:47:36,755 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:47:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-23 22:47:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-23 22:47:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-23 22:47:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-23 22:47:36,825 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-11-23 22:47:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,826 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-23 22:47:36,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-23 22:47:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-23 22:47:36,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,835 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:47:36,835 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-11-23 22:47:36,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049309131] [2019-11-23 22:47:36,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:36,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049309131] [2019-11-23 22:47:36,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299357312] [2019-11-23 22:47:36,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,951 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-23 22:47:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:37,176 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-23 22:47:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:37,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-23 22:47:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:37,191 INFO L225 Difference]: With dead ends: 5545 [2019-11-23 22:47:37,192 INFO L226 Difference]: Without dead ends: 2930 [2019-11-23 22:47:37,196 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:47:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-23 22:47:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-23 22:47:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-23 22:47:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-23 22:47:37,330 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-23 22:47:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:37,331 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-23 22:47:37,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-23 22:47:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 22:47:37,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:37,340 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:47:37,340 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-11-23 22:47:37,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:37,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103562239] [2019-11-23 22:47:37,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-23 22:47:37,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103562239] [2019-11-23 22:47:37,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:37,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:37,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769085402] [2019-11-23 22:47:37,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:37,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,514 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-23 22:47:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:37,588 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-23 22:47:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:37,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-23 22:47:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:37,613 INFO L225 Difference]: With dead ends: 7734 [2019-11-23 22:47:37,613 INFO L226 Difference]: Without dead ends: 5029 [2019-11-23 22:47:37,618 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:47:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-23 22:47:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-23 22:47:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-23 22:47:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-23 22:47:37,744 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-23 22:47:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:37,744 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-23 22:47:37,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-23 22:47:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-23 22:47:37,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:37,756 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 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:47:37,757 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:37,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-11-23 22:47:37,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:37,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630584689] [2019-11-23 22:47:37,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-23 22:47:38,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630584689] [2019-11-23 22:47:38,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855520214] [2019-11-23 22:47:38,008 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:47:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:38,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:38,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-23 22:47:38,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:38,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:38,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880589951] [2019-11-23 22:47:38,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:38,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:38,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:38,355 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-23 22:47:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:38,911 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-23 22:47:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:47:38,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-23 22:47:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:38,944 INFO L225 Difference]: With dead ends: 9987 [2019-11-23 22:47:38,944 INFO L226 Difference]: Without dead ends: 7540 [2019-11-23 22:47:38,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 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:47:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-23 22:47:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-23 22:47:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-23 22:47:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-23 22:47:39,159 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-11-23 22:47:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:39,159 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-23 22:47:39,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-23 22:47:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-23 22:47:39,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:39,177 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:39,393 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-11-23 22:47:39,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:39,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914796988] [2019-11-23 22:47:39,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:39,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914796988] [2019-11-23 22:47:39,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601769815] [2019-11-23 22:47:39,614 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:47:39,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:47:39,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:47:39,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:39,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:39,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:39,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:39,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416602944] [2019-11-23 22:47:39,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:39,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:39,964 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-23 22:47:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:40,316 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-23 22:47:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:40,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-23 22:47:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:40,330 INFO L225 Difference]: With dead ends: 12544 [2019-11-23 22:47:40,330 INFO L226 Difference]: Without dead ends: 6979 [2019-11-23 22:47:40,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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:47:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-23 22:47:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-23 22:47:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-23 22:47:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-23 22:47:40,469 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-23 22:47:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:40,469 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-23 22:47:40,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-23 22:47:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-23 22:47:40,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:40,483 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:40,688 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-11-23 22:47:40,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:40,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023732418] [2019-11-23 22:47:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-23 22:47:40,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023732418] [2019-11-23 22:47:40,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:40,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:40,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263192256] [2019-11-23 22:47:40,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:40,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:40,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,848 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-23 22:47:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,056 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-23 22:47:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-23 22:47:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,063 INFO L225 Difference]: With dead ends: 11015 [2019-11-23 22:47:41,064 INFO L226 Difference]: Without dead ends: 3069 [2019-11-23 22:47:41,073 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:47:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-23 22:47:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-23 22:47:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-23 22:47:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-23 22:47:41,130 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-23 22:47:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,131 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-23 22:47:41,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-23 22:47:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-23 22:47:41,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,143 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 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] [2019-11-23 22:47:41,143 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-11-23 22:47:41,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:41,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998582255] [2019-11-23 22:47:41,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-23 22:47:41,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998582255] [2019-11-23 22:47:41,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757787774] [2019-11-23 22:47:41,409 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:47:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:41,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-23 22:47:41,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:41,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:41,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702143932] [2019-11-23 22:47:41,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:41,834 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-23 22:47:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,872 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-23 22:47:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-11-23 22:47:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,877 INFO L225 Difference]: With dead ends: 3028 [2019-11-23 22:47:41,878 INFO L226 Difference]: Without dead ends: 2531 [2019-11-23 22:47:41,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 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:47:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-23 22:47:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-23 22:47:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-23 22:47:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-23 22:47:41,923 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-11-23 22:47:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,923 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-23 22:47:41,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-23 22:47:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-23 22:47:41,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,930 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 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] [2019-11-23 22:47:42,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:42,135 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-11-23 22:47:42,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576528240] [2019-11-23 22:47:42,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-11-23 22:47:42,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576528240] [2019-11-23 22:47:42,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674060631] [2019-11-23 22:47:42,350 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:47:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:47:42,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-23 22:47:42,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:42,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:42,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76017740] [2019-11-23 22:47:42,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:42,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:42,692 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-23 22:47:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,859 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-23 22:47:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:42,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-11-23 22:47:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,865 INFO L225 Difference]: With dead ends: 5060 [2019-11-23 22:47:42,865 INFO L226 Difference]: Without dead ends: 2589 [2019-11-23 22:47:42,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 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:47:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-23 22:47:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-23 22:47:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-23 22:47:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-23 22:47:42,914 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-11-23 22:47:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,915 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-23 22:47:42,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-23 22:47:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-11-23 22:47:42,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,922 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:47:43,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:43,126 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-11-23 22:47:43,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:43,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759552277] [2019-11-23 22:47:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-23 22:47:43,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759552277] [2019-11-23 22:47:43,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603069100] [2019-11-23 22:47:43,501 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:47:43,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:47:43,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:47:43,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:43,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-23 22:47:43,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:43,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:43,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457366111] [2019-11-23 22:47:43,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:43,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:43,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:43,828 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-23 22:47:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,012 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-23 22:47:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:44,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-11-23 22:47:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,013 INFO L225 Difference]: With dead ends: 2848 [2019-11-23 22:47:44,013 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:47:44,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 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:47:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:47:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:47:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:47:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:47:44,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-11-23 22:47:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:44,018 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:47:44,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:47:44,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:47:44,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:44,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:47:44,698 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-23 22:47:45,541 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-23 22:47:45,966 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-23 22:47:46,061 INFO L440 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,061 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 201 484) no Hoare annotation was computed. [2019-11-23 22:47:46,062 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-23 22:47:46,063 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-23 22:47:46,063 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-23 22:47:46,063 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-23 22:47:46,063 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-23 22:47:46,063 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-23 22:47:46,064 INFO L444 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-23 22:47:46,064 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-23 22:47:46,064 INFO L444 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-23 22:47:46,064 INFO L440 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L440 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L447 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-23 22:47:46,065 INFO L444 ceAbstractionStarter]: For program point L275-2(lines 275 279) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-23 22:47:46,066 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-23 22:47:46,067 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-23 22:47:46,067 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-23 22:47:46,067 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-23 22:47:46,067 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-23 22:47:46,068 INFO L444 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-23 22:47:46,068 INFO L444 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-23 22:47:46,068 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-23 22:47:46,068 INFO L440 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:46,068 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-23 22:47:46,068 INFO L444 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-23 22:47:46,069 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 256) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-23 22:47:46,070 INFO L447 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-23 22:47:46,070 INFO L440 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:46,071 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 296) no Hoare annotation was computed. [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 255) no Hoare annotation was computed. [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 286 296) no Hoare annotation was computed. [2019-11-23 22:47:46,071 INFO L444 ceAbstractionStarter]: For program point L253-2(lines 201 484) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L440 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-23 22:47:46,072 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-23 22:47:46,072 INFO L440 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-23 22:47:46,073 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-23 22:47:46,074 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-23 22:47:46,074 INFO L444 ceAbstractionStarter]: For program point L290-2(lines 288 296) no Hoare annotation was computed. [2019-11-23 22:47:46,074 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L440 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:46,075 INFO L440 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-23 22:47:46,075 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-23 22:47:46,076 INFO L440 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:46,076 INFO L440 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 264) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L447 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-23 22:47:46,077 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-23 22:47:46,078 INFO L440 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-23 22:47:46,078 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-23 22:47:46,078 INFO L447 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-23 22:47:46,079 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-23 22:47:46,079 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-23 22:47:46,079 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-23 22:47:46,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:46 BoogieIcfgContainer [2019-11-23 22:47:46,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:46,128 INFO L168 Benchmark]: Toolchain (without parser) took 16517.60 ms. Allocated memory was 144.7 MB in the beginning and 995.1 MB in the end (delta: 850.4 MB). Free memory was 100.0 MB in the beginning and 502.8 MB in the end (delta: -402.8 MB). Peak memory consumption was 447.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:46,128 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 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:47:46,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.17 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 177.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:46,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.84 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 174.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:46,132 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 ms. Allocated memory is still 201.9 MB. Free memory was 174.3 MB in the beginning and 172.4 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:47:46,133 INFO L168 Benchmark]: RCFGBuilder took 853.87 ms. Allocated memory is still 201.9 MB. Free memory was 172.4 MB in the beginning and 123.9 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:46,133 INFO L168 Benchmark]: TraceAbstraction took 15078.17 ms. Allocated memory was 201.9 MB in the beginning and 995.1 MB in the end (delta: 793.2 MB). Free memory was 123.9 MB in the beginning and 502.8 MB in the end (delta: -378.8 MB). Peak memory consumption was 414.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:46,138 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 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 471.17 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 177.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.84 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 174.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory is still 201.9 MB. Free memory was 174.3 MB in the beginning and 172.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.87 ms. Allocated memory is still 201.9 MB. Free memory was 172.4 MB in the beginning and 123.9 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15078.17 ms. Allocated memory was 201.9 MB in the beginning and 995.1 MB in the end (delta: 793.2 MB). Free memory was 123.9 MB in the beginning and 502.8 MB in the end (delta: -378.8 MB). Peak memory consumption was 414.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 182]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.9s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 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...