java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_3.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:53:22,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:53:22,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:53:22,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:53:22,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:53:22,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:53:22,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:53:22,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:53:22,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:53:22,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:53:22,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:53:22,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:53:22,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:53:22,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:53:22,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:53:22,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:53:22,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:53:22,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:53:22,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:53:22,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:53:22,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:53:22,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:53:22,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:53:22,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:53:22,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:53:22,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:53:22,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:53:22,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:53:22,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:53:22,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:53:22,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:53:22,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:53:22,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:53:22,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:53:22,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:53:22,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:53:22,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:53:22,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:53:22,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:53:22,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:53:22,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:53:22,986 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-09-07 12:53:22,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:53:23,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:53:23,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:53:23,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:53:23,001 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:53:23,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:53:23,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:53:23,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:53:23,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:53:23,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:53:23,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:53:23,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:53:23,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:53:23,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:53:23,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:53:23,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:53:23,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:53:23,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:53:23,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:53:23,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:53:23,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:53:23,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:53:23,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:53:23,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:53:23,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:53:23,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:53:23,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:53:23,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:53:23,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:53:23,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:53:23,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:53:23,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:53:23,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:53:23,050 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:53:23,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3.BV.c.cil.c [2019-09-07 12:53:23,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d679bf/4529f4015b654ef4ac5663ef8de0dcea/FLAG9f0cc926b [2019-09-07 12:53:23,573 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:53:23,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3.BV.c.cil.c [2019-09-07 12:53:23,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d679bf/4529f4015b654ef4ac5663ef8de0dcea/FLAG9f0cc926b [2019-09-07 12:53:23,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d679bf/4529f4015b654ef4ac5663ef8de0dcea [2019-09-07 12:53:23,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:53:23,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:53:23,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:53:23,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:53:23,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:53:23,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:53:23" (1/1) ... [2019-09-07 12:53:23,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d3ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:23, skipping insertion in model container [2019-09-07 12:53:23,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:53:23" (1/1) ... [2019-09-07 12:53:23,904 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:53:23,964 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:53:24,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:53:24,329 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:53:24,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:53:24,412 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:53:24,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24 WrapperNode [2019-09-07 12:53:24,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:53:24,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:53:24,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:53:24,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:53:24,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (1/1) ... [2019-09-07 12:53:24,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:53:24,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:53:24,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:53:24,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:53:24,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (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-09-07 12:53:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:53:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:53:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-07 12:53:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:53:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:53:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 12:53:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 12:53:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-07 12:53:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:53:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:53:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:53:24,750 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 12:53:25,214 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-07 12:53:25,214 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-07 12:53:25,219 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:53:25,220 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 12:53:25,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:53:25 BoogieIcfgContainer [2019-09-07 12:53:25,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:53:25,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:53:25,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:53:25,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:53:25,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:53:23" (1/3) ... [2019-09-07 12:53:25,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce9078b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:53:25, skipping insertion in model container [2019-09-07 12:53:25,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:24" (2/3) ... [2019-09-07 12:53:25,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce9078b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:53:25, skipping insertion in model container [2019-09-07 12:53:25,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:53:25" (3/3) ... [2019-09-07 12:53:25,241 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c [2019-09-07 12:53:25,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:53:25,262 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:53:25,279 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:53:25,315 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:53:25,316 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:53:25,317 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:53:25,317 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:53:25,317 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:53:25,317 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:53:25,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:53:25,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:53:25,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:53:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-09-07 12:53:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 12:53:25,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:25,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:25,350 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -459257302, now seen corresponding path program 1 times [2019-09-07 12:53:25,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:25,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:25,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:25,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:53:25,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:25,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:25,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:25,646 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2019-09-07 12:53:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:26,093 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-09-07 12:53:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:26,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-07 12:53:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:26,119 INFO L225 Difference]: With dead ends: 332 [2019-09-07 12:53:26,119 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 12:53:26,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 12:53:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2019-09-07 12:53:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 12:53:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-09-07 12:53:26,190 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 49 [2019-09-07 12:53:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:26,191 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-09-07 12:53:26,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-09-07 12:53:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:53:26,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:26,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:26,195 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1359139796, now seen corresponding path program 1 times [2019-09-07 12:53:26,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:26,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:53:26,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:26,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:26,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:26,328 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 5 states. [2019-09-07 12:53:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:26,647 INFO L93 Difference]: Finished difference Result 377 states and 621 transitions. [2019-09-07 12:53:26,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:26,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-07 12:53:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:26,652 INFO L225 Difference]: With dead ends: 377 [2019-09-07 12:53:26,653 INFO L226 Difference]: Without dead ends: 217 [2019-09-07 12:53:26,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-07 12:53:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2019-09-07 12:53:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 12:53:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2019-09-07 12:53:26,696 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 50 [2019-09-07 12:53:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:26,701 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2019-09-07 12:53:26,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2019-09-07 12:53:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 12:53:26,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:26,709 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-09-07 12:53:26,709 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -250817147, now seen corresponding path program 1 times [2019-09-07 12:53:26,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:26,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:53:26,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:26,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:26,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:26,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:26,845 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand 5 states. [2019-09-07 12:53:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:27,125 INFO L93 Difference]: Finished difference Result 442 states and 747 transitions. [2019-09-07 12:53:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:27,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-07 12:53:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:27,128 INFO L225 Difference]: With dead ends: 442 [2019-09-07 12:53:27,129 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 12:53:27,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 12:53:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-09-07 12:53:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-07 12:53:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 409 transitions. [2019-09-07 12:53:27,147 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 409 transitions. Word has length 77 [2019-09-07 12:53:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:27,147 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 409 transitions. [2019-09-07 12:53:27,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 409 transitions. [2019-09-07 12:53:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 12:53:27,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:27,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 12:53:27,151 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash -508376229, now seen corresponding path program 1 times [2019-09-07 12:53:27,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:27,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:27,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:27,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:27,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:27,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:27,239 INFO L87 Difference]: Start difference. First operand 243 states and 409 transitions. Second operand 5 states. [2019-09-07 12:53:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:27,446 INFO L93 Difference]: Finished difference Result 490 states and 829 transitions. [2019-09-07 12:53:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:27,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 12:53:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:27,450 INFO L225 Difference]: With dead ends: 490 [2019-09-07 12:53:27,450 INFO L226 Difference]: Without dead ends: 260 [2019-09-07 12:53:27,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-07 12:53:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-09-07 12:53:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-07 12:53:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 432 transitions. [2019-09-07 12:53:27,475 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 432 transitions. Word has length 89 [2019-09-07 12:53:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:27,479 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 432 transitions. [2019-09-07 12:53:27,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 432 transitions. [2019-09-07 12:53:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 12:53:27,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:27,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:27,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash 384668356, now seen corresponding path program 1 times [2019-09-07 12:53:27,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:27,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:53:27,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:27,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:27,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:27,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:27,608 INFO L87 Difference]: Start difference. First operand 258 states and 432 transitions. Second operand 5 states. [2019-09-07 12:53:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:27,851 INFO L93 Difference]: Finished difference Result 549 states and 928 transitions. [2019-09-07 12:53:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:27,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 12:53:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:27,854 INFO L225 Difference]: With dead ends: 549 [2019-09-07 12:53:27,854 INFO L226 Difference]: Without dead ends: 304 [2019-09-07 12:53:27,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-07 12:53:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2019-09-07 12:53:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-07 12:53:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 506 transitions. [2019-09-07 12:53:27,869 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 506 transitions. Word has length 89 [2019-09-07 12:53:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:27,870 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 506 transitions. [2019-09-07 12:53:27,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 506 transitions. [2019-09-07 12:53:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 12:53:27,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:27,872 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 12:53:27,872 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1150340194, now seen corresponding path program 1 times [2019-09-07 12:53:27,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:27,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:27,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:27,952 INFO L87 Difference]: Start difference. First operand 300 states and 506 transitions. Second operand 5 states. [2019-09-07 12:53:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:28,147 INFO L93 Difference]: Finished difference Result 589 states and 997 transitions. [2019-09-07 12:53:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:28,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-07 12:53:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:28,150 INFO L225 Difference]: With dead ends: 589 [2019-09-07 12:53:28,150 INFO L226 Difference]: Without dead ends: 302 [2019-09-07 12:53:28,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-07 12:53:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-09-07 12:53:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-07 12:53:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 502 transitions. [2019-09-07 12:53:28,165 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 502 transitions. Word has length 90 [2019-09-07 12:53:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:28,165 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 502 transitions. [2019-09-07 12:53:28,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 502 transitions. [2019-09-07 12:53:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 12:53:28,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:28,167 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:28,167 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash 12513126, now seen corresponding path program 1 times [2019-09-07 12:53:28,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:28,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:28,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:28,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:53:28,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:28,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:28,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:28,258 INFO L87 Difference]: Start difference. First operand 300 states and 502 transitions. Second operand 5 states. [2019-09-07 12:53:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:28,474 INFO L93 Difference]: Finished difference Result 591 states and 992 transitions. [2019-09-07 12:53:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:28,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-07 12:53:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:28,477 INFO L225 Difference]: With dead ends: 591 [2019-09-07 12:53:28,478 INFO L226 Difference]: Without dead ends: 302 [2019-09-07 12:53:28,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-07 12:53:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-09-07 12:53:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-07 12:53:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 497 transitions. [2019-09-07 12:53:28,492 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 497 transitions. Word has length 90 [2019-09-07 12:53:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:28,492 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 497 transitions. [2019-09-07 12:53:28,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 497 transitions. [2019-09-07 12:53:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 12:53:28,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:28,495 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-07 12:53:28,495 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1256654058, now seen corresponding path program 1 times [2019-09-07 12:53:28,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:28,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 12:53:28,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:28,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:28,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:28,571 INFO L87 Difference]: Start difference. First operand 298 states and 497 transitions. Second operand 5 states. [2019-09-07 12:53:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:28,805 INFO L93 Difference]: Finished difference Result 591 states and 988 transitions. [2019-09-07 12:53:28,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:28,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-07 12:53:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:28,808 INFO L225 Difference]: With dead ends: 591 [2019-09-07 12:53:28,809 INFO L226 Difference]: Without dead ends: 306 [2019-09-07 12:53:28,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-07 12:53:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-07 12:53:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 12:53:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-07 12:53:28,831 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 101 [2019-09-07 12:53:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:28,831 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-07 12:53:28,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-07 12:53:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 12:53:28,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:28,834 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:28,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash -315055682, now seen corresponding path program 1 times [2019-09-07 12:53:28,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:28,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:28,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:28,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:28,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:28,931 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 5 states. [2019-09-07 12:53:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:29,177 INFO L93 Difference]: Finished difference Result 630 states and 1040 transitions. [2019-09-07 12:53:29,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:29,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 12:53:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:29,180 INFO L225 Difference]: With dead ends: 630 [2019-09-07 12:53:29,180 INFO L226 Difference]: Without dead ends: 337 [2019-09-07 12:53:29,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-07 12:53:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2019-09-07 12:53:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-07 12:53:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2019-09-07 12:53:29,197 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 103 [2019-09-07 12:53:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:29,197 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2019-09-07 12:53:29,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2019-09-07 12:53:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 12:53:29,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:29,199 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:29,200 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1874973505, now seen corresponding path program 1 times [2019-09-07 12:53:29,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:29,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:29,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:29,254 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 5 states. [2019-09-07 12:53:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:29,437 INFO L93 Difference]: Finished difference Result 691 states and 1140 transitions. [2019-09-07 12:53:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:29,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-07 12:53:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:29,440 INFO L225 Difference]: With dead ends: 691 [2019-09-07 12:53:29,440 INFO L226 Difference]: Without dead ends: 369 [2019-09-07 12:53:29,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-07 12:53:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-07 12:53:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-07 12:53:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 591 transitions. [2019-09-07 12:53:29,458 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 591 transitions. Word has length 104 [2019-09-07 12:53:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:29,459 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 591 transitions. [2019-09-07 12:53:29,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 591 transitions. [2019-09-07 12:53:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 12:53:29,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:29,461 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:29,461 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -411681051, now seen corresponding path program 1 times [2019-09-07 12:53:29,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:29,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:29,519 INFO L87 Difference]: Start difference. First operand 362 states and 591 transitions. Second operand 5 states. [2019-09-07 12:53:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:29,736 INFO L93 Difference]: Finished difference Result 713 states and 1167 transitions. [2019-09-07 12:53:29,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:29,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-07 12:53:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:29,739 INFO L225 Difference]: With dead ends: 713 [2019-09-07 12:53:29,739 INFO L226 Difference]: Without dead ends: 364 [2019-09-07 12:53:29,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-07 12:53:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-09-07 12:53:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-07 12:53:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2019-09-07 12:53:29,763 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 104 [2019-09-07 12:53:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:29,763 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2019-09-07 12:53:29,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2019-09-07 12:53:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 12:53:29,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:29,766 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:29,767 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1317457818, now seen corresponding path program 1 times [2019-09-07 12:53:29,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 12:53:29,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:29,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:29,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:29,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:29,899 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 5 states. [2019-09-07 12:53:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:30,154 INFO L93 Difference]: Finished difference Result 718 states and 1169 transitions. [2019-09-07 12:53:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:30,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-07 12:53:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:30,158 INFO L225 Difference]: With dead ends: 718 [2019-09-07 12:53:30,158 INFO L226 Difference]: Without dead ends: 369 [2019-09-07 12:53:30,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-07 12:53:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-07 12:53:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-07 12:53:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2019-09-07 12:53:30,176 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 105 [2019-09-07 12:53:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:30,177 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2019-09-07 12:53:30,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2019-09-07 12:53:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 12:53:30,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:30,179 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:30,179 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -817214863, now seen corresponding path program 1 times [2019-09-07 12:53:30,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:30,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:30,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:30,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 12:53:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:30,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:30,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:30,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:30,237 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 5 states. [2019-09-07 12:53:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:30,421 INFO L93 Difference]: Finished difference Result 736 states and 1188 transitions. [2019-09-07 12:53:30,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:30,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-07 12:53:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:30,424 INFO L225 Difference]: With dead ends: 736 [2019-09-07 12:53:30,424 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 12:53:30,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 12:53:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-07 12:53:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-07 12:53:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2019-09-07 12:53:30,443 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 110 [2019-09-07 12:53:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:30,443 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2019-09-07 12:53:30,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2019-09-07 12:53:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 12:53:30,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:30,446 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:30,446 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1429215766, now seen corresponding path program 1 times [2019-09-07 12:53:30,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:30,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 12:53:30,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:53:30,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:53:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:53:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:30,515 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 5 states. [2019-09-07 12:53:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:30,715 INFO L93 Difference]: Finished difference Result 757 states and 1211 transitions. [2019-09-07 12:53:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:30,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-07 12:53:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:30,720 INFO L225 Difference]: With dead ends: 757 [2019-09-07 12:53:30,720 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 12:53:30,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:53:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 12:53:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-07 12:53:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-07 12:53:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2019-09-07 12:53:30,739 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 111 [2019-09-07 12:53:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:30,740 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2019-09-07 12:53:30,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:53:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2019-09-07 12:53:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 12:53:30,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:30,742 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-07 12:53:30,742 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:30,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1449286990, now seen corresponding path program 1 times [2019-09-07 12:53:30,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 12:53:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:30,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:30,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:30,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:30,813 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2019-09-07 12:53:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:30,859 INFO L93 Difference]: Finished difference Result 753 states and 1193 transitions. [2019-09-07 12:53:30,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:30,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-07 12:53:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:30,863 INFO L225 Difference]: With dead ends: 753 [2019-09-07 12:53:30,864 INFO L226 Difference]: Without dead ends: 751 [2019-09-07 12:53:30,866 INFO L628 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-09-07 12:53:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-07 12:53:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-09-07 12:53:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-07 12:53:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1191 transitions. [2019-09-07 12:53:30,899 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1191 transitions. Word has length 126 [2019-09-07 12:53:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:30,899 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1191 transitions. [2019-09-07 12:53:30,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1191 transitions. [2019-09-07 12:53:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 12:53:30,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:30,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:30,903 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1360581389, now seen corresponding path program 1 times [2019-09-07 12:53:30,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:30,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:30,914 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:53:30,914 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:53:30,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-07 12:53:30,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:30,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 12:53:30,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 12:53:31,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:31,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:31,051 INFO L87 Difference]: Start difference. First operand 751 states and 1191 transitions. Second operand 3 states. [2019-09-07 12:53:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:31,132 INFO L93 Difference]: Finished difference Result 1857 states and 2951 transitions. [2019-09-07 12:53:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:31,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-07 12:53:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:31,138 INFO L225 Difference]: With dead ends: 1857 [2019-09-07 12:53:31,138 INFO L226 Difference]: Without dead ends: 1119 [2019-09-07 12:53:31,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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-09-07 12:53:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-07 12:53:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-09-07 12:53:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-07 12:53:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1774 transitions. [2019-09-07 12:53:31,196 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1774 transitions. Word has length 127 [2019-09-07 12:53:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:31,196 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1774 transitions. [2019-09-07 12:53:31,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1774 transitions. [2019-09-07 12:53:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 12:53:31,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:31,200 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:31,200 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1941520082, now seen corresponding path program 1 times [2019-09-07 12:53:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 12:53:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:31,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:31,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:31,252 INFO L87 Difference]: Start difference. First operand 1119 states and 1774 transitions. Second operand 3 states. [2019-09-07 12:53:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:31,442 INFO L93 Difference]: Finished difference Result 2237 states and 3548 transitions. [2019-09-07 12:53:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:31,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-07 12:53:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:31,449 INFO L225 Difference]: With dead ends: 2237 [2019-09-07 12:53:31,450 INFO L226 Difference]: Without dead ends: 1131 [2019-09-07 12:53:31,453 INFO L628 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-09-07 12:53:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-09-07 12:53:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1119. [2019-09-07 12:53:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-07 12:53:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1747 transitions. [2019-09-07 12:53:31,504 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1747 transitions. Word has length 143 [2019-09-07 12:53:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:31,504 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1747 transitions. [2019-09-07 12:53:31,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1747 transitions. [2019-09-07 12:53:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-07 12:53:31,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:31,508 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:31,508 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:31,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1426466207, now seen corresponding path program 1 times [2019-09-07 12:53:31,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:31,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,520 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:53:31,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:53:31,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-07 12:53:31,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 12:53:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:31,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 12:53:31,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 12:53:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:31,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:31,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:31,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:31,703 INFO L87 Difference]: Start difference. First operand 1119 states and 1747 transitions. Second operand 3 states. [2019-09-07 12:53:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:31,780 INFO L93 Difference]: Finished difference Result 2225 states and 3480 transitions. [2019-09-07 12:53:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:31,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-07 12:53:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:31,788 INFO L225 Difference]: With dead ends: 2225 [2019-09-07 12:53:31,788 INFO L226 Difference]: Without dead ends: 1487 [2019-09-07 12:53:31,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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-09-07 12:53:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-07 12:53:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2019-09-07 12:53:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-09-07 12:53:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2323 transitions. [2019-09-07 12:53:31,861 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2323 transitions. Word has length 164 [2019-09-07 12:53:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:31,861 INFO L475 AbstractCegarLoop]: Abstraction has 1487 states and 2323 transitions. [2019-09-07 12:53:31,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2323 transitions. [2019-09-07 12:53:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 12:53:31,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:31,866 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:31,867 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -391989381, now seen corresponding path program 1 times [2019-09-07 12:53:31,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 12:53:31,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:31,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:31,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:31,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:31,944 INFO L87 Difference]: Start difference. First operand 1487 states and 2323 transitions. Second operand 3 states. [2019-09-07 12:53:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:32,176 INFO L93 Difference]: Finished difference Result 2997 states and 4673 transitions. [2019-09-07 12:53:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:32,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-07 12:53:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:32,185 INFO L225 Difference]: With dead ends: 2997 [2019-09-07 12:53:32,185 INFO L226 Difference]: Without dead ends: 1523 [2019-09-07 12:53:32,188 INFO L628 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-09-07 12:53:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-09-07 12:53:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1487. [2019-09-07 12:53:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-09-07 12:53:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2251 transitions. [2019-09-07 12:53:32,252 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2251 transitions. Word has length 204 [2019-09-07 12:53:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:32,252 INFO L475 AbstractCegarLoop]: Abstraction has 1487 states and 2251 transitions. [2019-09-07 12:53:32,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2251 transitions. [2019-09-07 12:53:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 12:53:32,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:32,258 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:32,258 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:32,259 INFO L82 PathProgramCache]: Analyzing trace with hash -945704107, now seen corresponding path program 1 times [2019-09-07 12:53:32,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:32,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:32,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-07 12:53:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:32,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:32,364 INFO L87 Difference]: Start difference. First operand 1487 states and 2251 transitions. Second operand 3 states. [2019-09-07 12:53:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:32,581 INFO L93 Difference]: Finished difference Result 3043 states and 4594 transitions. [2019-09-07 12:53:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:32,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-07 12:53:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:32,589 INFO L225 Difference]: With dead ends: 3043 [2019-09-07 12:53:32,590 INFO L226 Difference]: Without dead ends: 1569 [2019-09-07 12:53:32,592 INFO L628 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-09-07 12:53:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2019-09-07 12:53:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1493. [2019-09-07 12:53:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-09-07 12:53:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2204 transitions. [2019-09-07 12:53:32,652 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2204 transitions. Word has length 217 [2019-09-07 12:53:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:32,653 INFO L475 AbstractCegarLoop]: Abstraction has 1493 states and 2204 transitions. [2019-09-07 12:53:32,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2204 transitions. [2019-09-07 12:53:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-07 12:53:32,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:32,659 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-09-07 12:53:32,659 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:32,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1110401752, now seen corresponding path program 1 times [2019-09-07 12:53:32,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:32,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:32,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:32,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:32,684 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:53:32,684 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:53:32,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-07 12:53:32,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:32,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:53:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 12:53:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:32,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:32,885 INFO L87 Difference]: Start difference. First operand 1493 states and 2204 transitions. Second operand 3 states. [2019-09-07 12:53:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:32,982 INFO L93 Difference]: Finished difference Result 4425 states and 6544 transitions. [2019-09-07 12:53:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:32,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-07 12:53:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:32,996 INFO L225 Difference]: With dead ends: 4425 [2019-09-07 12:53:32,996 INFO L226 Difference]: Without dead ends: 2951 [2019-09-07 12:53:32,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 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-09-07 12:53:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-09-07 12:53:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2019-09-07 12:53:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-09-07 12:53:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4353 transitions. [2019-09-07 12:53:33,124 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4353 transitions. Word has length 246 [2019-09-07 12:53:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:33,124 INFO L475 AbstractCegarLoop]: Abstraction has 2949 states and 4353 transitions. [2019-09-07 12:53:33,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4353 transitions. [2019-09-07 12:53:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 12:53:33,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:33,135 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-09-07 12:53:33,136 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:33,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1423055184, now seen corresponding path program 1 times [2019-09-07 12:53:33,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:33,153 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:53:33,153 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:53:33,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-07 12:53:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:33,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:53:33,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Exception during sending of exit command (exit): Stream closed [2019-09-07 12:53:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:33,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:33,360 INFO L87 Difference]: Start difference. First operand 2949 states and 4353 transitions. Second operand 3 states. [2019-09-07 12:53:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:33,573 INFO L93 Difference]: Finished difference Result 5879 states and 8680 transitions. [2019-09-07 12:53:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:33,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-07 12:53:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:33,588 INFO L225 Difference]: With dead ends: 5879 [2019-09-07 12:53:33,588 INFO L226 Difference]: Without dead ends: 2949 [2019-09-07 12:53:33,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 281 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-09-07 12:53:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-07 12:53:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2019-09-07 12:53:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-09-07 12:53:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4265 transitions. [2019-09-07 12:53:33,704 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4265 transitions. Word has length 283 [2019-09-07 12:53:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:33,704 INFO L475 AbstractCegarLoop]: Abstraction has 2949 states and 4265 transitions. [2019-09-07 12:53:33,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4265 transitions. [2019-09-07 12:53:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-07 12:53:33,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:33,718 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 12:53:33,718 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 464693141, now seen corresponding path program 1 times [2019-09-07 12:53:33,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:33,740 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:53:33,740 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:53:33,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-07 12:53:33,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 12:53:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:33,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 12:53:33,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 12:53:33,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:33,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:33,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:33,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:33,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:33,975 INFO L87 Difference]: Start difference. First operand 2949 states and 4265 transitions. Second operand 3 states. [2019-09-07 12:53:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:34,191 INFO L93 Difference]: Finished difference Result 6191 states and 8992 transitions. [2019-09-07 12:53:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:34,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-07 12:53:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:34,200 INFO L225 Difference]: With dead ends: 6191 [2019-09-07 12:53:34,200 INFO L226 Difference]: Without dead ends: 1839 [2019-09-07 12:53:34,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 309 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-09-07 12:53:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-09-07 12:53:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2019-09-07 12:53:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-09-07 12:53:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2625 transitions. [2019-09-07 12:53:34,298 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2625 transitions. Word has length 311 [2019-09-07 12:53:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:34,299 INFO L475 AbstractCegarLoop]: Abstraction has 1839 states and 2625 transitions. [2019-09-07 12:53:34,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2625 transitions. [2019-09-07 12:53:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 12:53:34,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:34,313 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-07 12:53:34,314 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash -60637526, now seen corresponding path program 1 times [2019-09-07 12:53:34,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:34,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-07 12:53:34,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:34,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:34,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:34,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:34,465 INFO L87 Difference]: Start difference. First operand 1839 states and 2625 transitions. Second operand 3 states. [2019-09-07 12:53:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:34,720 INFO L93 Difference]: Finished difference Result 3766 states and 5380 transitions. [2019-09-07 12:53:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:34,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-07 12:53:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:34,734 INFO L225 Difference]: With dead ends: 3766 [2019-09-07 12:53:34,734 INFO L226 Difference]: Without dead ends: 1946 [2019-09-07 12:53:34,738 INFO L628 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-09-07 12:53:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-09-07 12:53:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1931. [2019-09-07 12:53:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2019-09-07 12:53:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2737 transitions. [2019-09-07 12:53:34,885 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2737 transitions. Word has length 312 [2019-09-07 12:53:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:34,885 INFO L475 AbstractCegarLoop]: Abstraction has 1931 states and 2737 transitions. [2019-09-07 12:53:34,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2737 transitions. [2019-09-07 12:53:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-07 12:53:34,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:34,903 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-07 12:53:34,903 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1485741080, now seen corresponding path program 1 times [2019-09-07 12:53:34,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:34,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-07 12:53:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:35,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:35,077 INFO L87 Difference]: Start difference. First operand 1931 states and 2737 transitions. Second operand 3 states. [2019-09-07 12:53:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:35,342 INFO L93 Difference]: Finished difference Result 4028 states and 5738 transitions. [2019-09-07 12:53:35,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:35,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-07 12:53:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:35,356 INFO L225 Difference]: With dead ends: 4028 [2019-09-07 12:53:35,356 INFO L226 Difference]: Without dead ends: 2116 [2019-09-07 12:53:35,361 INFO L628 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-09-07 12:53:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-09-07 12:53:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2056. [2019-09-07 12:53:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-07 12:53:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2887 transitions. [2019-09-07 12:53:35,465 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2887 transitions. Word has length 332 [2019-09-07 12:53:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:35,466 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2887 transitions. [2019-09-07 12:53:35,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2887 transitions. [2019-09-07 12:53:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-07 12:53:35,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:35,483 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-07 12:53:35,483 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash 432297452, now seen corresponding path program 1 times [2019-09-07 12:53:35,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:35,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-09-07 12:53:35,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:35,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:35,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:35,667 INFO L87 Difference]: Start difference. First operand 2056 states and 2887 transitions. Second operand 3 states. [2019-09-07 12:53:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:35,936 INFO L93 Difference]: Finished difference Result 4128 states and 5808 transitions. [2019-09-07 12:53:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:35,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-09-07 12:53:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:35,957 INFO L225 Difference]: With dead ends: 4128 [2019-09-07 12:53:35,957 INFO L226 Difference]: Without dead ends: 2091 [2019-09-07 12:53:35,967 INFO L628 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-09-07 12:53:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-09-07 12:53:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2056. [2019-09-07 12:53:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-07 12:53:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2837 transitions. [2019-09-07 12:53:36,045 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2837 transitions. Word has length 358 [2019-09-07 12:53:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:36,045 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2837 transitions. [2019-09-07 12:53:36,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2837 transitions. [2019-09-07 12:53:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-07 12:53:36,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:36,054 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-09-07 12:53:36,055 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash 222053756, now seen corresponding path program 1 times [2019-09-07 12:53:36,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:36,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-07 12:53:36,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:53:36,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:53:36,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:36,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:53:36,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-07 12:53:36,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:53:36,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 12:53:36,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:53:36,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:53:36,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:53:36,494 INFO L87 Difference]: Start difference. First operand 2056 states and 2837 transitions. Second operand 4 states. [2019-09-07 12:53:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:36,927 INFO L93 Difference]: Finished difference Result 5381 states and 7409 transitions. [2019-09-07 12:53:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:53:36,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-09-07 12:53:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:36,934 INFO L225 Difference]: With dead ends: 5381 [2019-09-07 12:53:36,935 INFO L226 Difference]: Without dead ends: 3237 [2019-09-07 12:53:36,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 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-09-07 12:53:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2019-09-07 12:53:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2137. [2019-09-07 12:53:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-09-07 12:53:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2917 transitions. [2019-09-07 12:53:37,012 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2917 transitions. Word has length 375 [2019-09-07 12:53:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:37,012 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 2917 transitions. [2019-09-07 12:53:37,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:53:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2917 transitions. [2019-09-07 12:53:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-07 12:53:37,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:37,023 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 12:53:37,024 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1893965958, now seen corresponding path program 1 times [2019-09-07 12:53:37,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:37,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-09-07 12:53:37,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:37,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:37,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:37,165 INFO L87 Difference]: Start difference. First operand 2137 states and 2917 transitions. Second operand 3 states. [2019-09-07 12:53:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:37,337 INFO L93 Difference]: Finished difference Result 4265 states and 5818 transitions. [2019-09-07 12:53:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-09-07 12:53:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:37,342 INFO L225 Difference]: With dead ends: 4265 [2019-09-07 12:53:37,342 INFO L226 Difference]: Without dead ends: 2147 [2019-09-07 12:53:37,346 INFO L628 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-09-07 12:53:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-09-07 12:53:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2137. [2019-09-07 12:53:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-09-07 12:53:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2867 transitions. [2019-09-07 12:53:37,411 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2867 transitions. Word has length 443 [2019-09-07 12:53:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:37,412 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 2867 transitions. [2019-09-07 12:53:37,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2867 transitions. [2019-09-07 12:53:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-07 12:53:37,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:37,423 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 12:53:37,423 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash 756608049, now seen corresponding path program 1 times [2019-09-07 12:53:37,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-09-07 12:53:37,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:37,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:37,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:37,619 INFO L87 Difference]: Start difference. First operand 2137 states and 2867 transitions. Second operand 3 states. [2019-09-07 12:53:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:37,799 INFO L93 Difference]: Finished difference Result 4435 states and 5973 transitions. [2019-09-07 12:53:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:37,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-07 12:53:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:37,804 INFO L225 Difference]: With dead ends: 4435 [2019-09-07 12:53:37,804 INFO L226 Difference]: Without dead ends: 2317 [2019-09-07 12:53:37,810 INFO L628 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-09-07 12:53:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-09-07 12:53:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2307. [2019-09-07 12:53:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-09-07 12:53:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3062 transitions. [2019-09-07 12:53:37,887 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3062 transitions. Word has length 475 [2019-09-07 12:53:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:37,887 INFO L475 AbstractCegarLoop]: Abstraction has 2307 states and 3062 transitions. [2019-09-07 12:53:37,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3062 transitions. [2019-09-07 12:53:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-09-07 12:53:37,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:37,901 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:53:37,901 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash -10886553, now seen corresponding path program 1 times [2019-09-07 12:53:37,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-09-07 12:53:38,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:38,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:38,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:38,122 INFO L87 Difference]: Start difference. First operand 2307 states and 3062 transitions. Second operand 3 states. [2019-09-07 12:53:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:38,318 INFO L93 Difference]: Finished difference Result 4785 states and 6383 transitions. [2019-09-07 12:53:38,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:38,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-09-07 12:53:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:38,324 INFO L225 Difference]: With dead ends: 4785 [2019-09-07 12:53:38,324 INFO L226 Difference]: Without dead ends: 2497 [2019-09-07 12:53:38,329 INFO L628 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-09-07 12:53:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2019-09-07 12:53:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2487. [2019-09-07 12:53:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2019-09-07 12:53:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3267 transitions. [2019-09-07 12:53:38,402 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3267 transitions. Word has length 537 [2019-09-07 12:53:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:38,402 INFO L475 AbstractCegarLoop]: Abstraction has 2487 states and 3267 transitions. [2019-09-07 12:53:38,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3267 transitions. [2019-09-07 12:53:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-09-07 12:53:38,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:38,411 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 12:53:38,411 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1755141137, now seen corresponding path program 1 times [2019-09-07 12:53:38,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:38,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-07 12:53:38,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:53:38,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:53:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:53:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:38,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:53:38,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:53:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:53:39,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 12:53:39,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:53:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:53:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:53:39,047 INFO L87 Difference]: Start difference. First operand 2487 states and 3267 transitions. Second operand 4 states. [2019-09-07 12:53:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:39,294 INFO L93 Difference]: Finished difference Result 3692 states and 4854 transitions. [2019-09-07 12:53:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:53:39,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-09-07 12:53:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:39,296 INFO L225 Difference]: With dead ends: 3692 [2019-09-07 12:53:39,296 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 12:53:39,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 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-09-07 12:53:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 12:53:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 12:53:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 12:53:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 12:53:39,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-09-07 12:53:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:39,309 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 12:53:39,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:53:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 12:53:39,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 12:53:39,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 12:53:39,456 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-07 12:53:40,249 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-07 12:53:40,485 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 101 [2019-09-07 12:53:40,887 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 103 [2019-09-07 12:53:41,592 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-07 12:53:42,061 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-07 12:53:42,375 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-07 12:53:42,795 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-07 12:53:43,216 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-07 12:53:43,371 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-09-07 12:53:43,825 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-07 12:53:44,301 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2019-09-07 12:53:44,661 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-09-07 12:53:45,052 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-09-07 12:53:45,694 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-07 12:53:46,084 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-07 12:53:46,456 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-07 12:53:46,919 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-09-07 12:53:47,098 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-07 12:53:47,729 WARN L188 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-07 12:53:48,171 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-07 12:53:48,690 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-07 12:53:49,402 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2019-09-07 12:53:49,912 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-09-07 12:53:50,750 WARN L188 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-07 12:53:51,144 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-07 12:53:51,147 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 12:53:51,147 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:53:51,147 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:53:51,147 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 12:53:51,147 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 12:53:51,147 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 12:53:51,148 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 674 685) the Hoare annotation is: true [2019-09-07 12:53:51,148 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 674 685) no Hoare annotation was computed. [2019-09-07 12:53:51,148 INFO L439 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-09-07 12:53:51,148 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 674 685) no Hoare annotation was computed. [2019-09-07 12:53:51,148 INFO L443 ceAbstractionStarter]: For program point L681-1(line 681) no Hoare annotation was computed. [2019-09-07 12:53:51,148 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2019-09-07 12:53:51,148 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 591) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (and (<= 8672 ssl3_accept_~s__state~0) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 12292))) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 12:53:51,149 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 623) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (and (<= 8672 ssl3_accept_~s__state~0) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__hit~0 0)))) [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 503) no Hoare annotation was computed. [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L499-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 589) no Hoare annotation was computed. [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 600) no Hoare annotation was computed. [2019-09-07 12:53:51,149 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 611) no Hoare annotation was computed. [2019-09-07 12:53:51,150 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 622) no Hoare annotation was computed. [2019-09-07 12:53:51,150 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 589) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (not (= ssl3_accept_~s__state~0 8672)) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 12:53:51,150 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 601) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8657))) (.cse5 (not (= ssl3_accept_~s__state~0 8672))) (.cse6 (not (= ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ssl3_accept_~s__state~0 8656))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,150 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 612) the Hoare annotation is: (let ((.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse2 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse3 (= 8448 |ssl3_accept_#in~initial_state|))) (let ((.cse5 (and (and (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse1) (not .cse4) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not .cse2) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not .cse3) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8656))) (<= ssl3_accept_~blastFlag~0 3)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ssl3_accept_~s__hit~0 0)) .cse5 (<= ssl3_accept_~s__state~0 8672)) (and (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~blastFlag~0 2) .cse5) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)))) [2019-09-07 12:53:51,150 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2019-09-07 12:53:51,150 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 579) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L569-1(lines 569 579) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 599) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 610) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 621) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2019-09-07 12:53:51,151 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 588) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (not (= ssl3_accept_~s__state~0 8672)) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L446 ceAbstractionStarter]: At program point L670(lines 63 672) the Hoare annotation is: true [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 543) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L439 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L340-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,152 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 8 673) the Hoare annotation is: true [2019-09-07 12:53:51,152 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 576) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 598) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 609) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 620) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 599) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8657))) (.cse5 (not (= ssl3_accept_~s__state~0 8672))) (.cse6 (not (= ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ssl3_accept_~s__state~0 8656))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,153 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 610) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,153 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-09-07 12:53:51,153 INFO L439 ceAbstractionStarter]: At program point L211(lines 104 622) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ssl3_accept_~s__state~0 8657))) (.cse10 (not (= ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ssl3_accept_~s__state~0 8656)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse9 (not (= ssl3_accept_~s__state~0 12292)) (<= ssl3_accept_~blastFlag~0 0) .cse10 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse12) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 666) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L509-2(lines 509 513) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 597) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 608) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 619) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 63 672) no Hoare annotation was computed. [2019-09-07 12:53:51,154 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 596) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 607) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 618) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2019-09-07 12:53:51,155 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 597) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8657))) (.cse5 (not (= ssl3_accept_~s__state~0 8672))) (.cse6 (not (= ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ssl3_accept_~s__state~0 8656))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,156 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 608) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 552) no Hoare annotation was computed. [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 595) no Hoare annotation was computed. [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 606) no Hoare annotation was computed. [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 617) no Hoare annotation was computed. [2019-09-07 12:53:51,156 INFO L439 ceAbstractionStarter]: At program point L549(lines 63 672) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 12:53:51,156 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 618) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 (<= ssl3_accept_~s__state~0 8576)) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 594) no Hoare annotation was computed. [2019-09-07 12:53:51,157 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 605) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 616) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 8 673) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L443 ceAbstractionStarter]: For program point L288-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,158 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 595) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8657))) (.cse5 (not (= ssl3_accept_~s__state~0 8672))) (.cse6 (not (= ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ssl3_accept_~s__state~0 8656))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,159 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 606) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,159 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 616) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (and (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__state~0 8656)) (<= ssl3_accept_~s__state~0 8672))) [2019-09-07 12:53:51,159 INFO L439 ceAbstractionStarter]: At program point L586(lines 98 654) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (= ssl3_accept_~s__state~0 8448)) (.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse3 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (and (not (= ssl3_accept_~s__state~0 8481)) .cse1 (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8561)) (not .cse2) (not (= ssl3_accept_~s__state~0 8497)) .cse3) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse3) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (<= ssl3_accept_~s__state~0 3))) [2019-09-07 12:53:51,159 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-09-07 12:53:51,159 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 593) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 604) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 615) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 8 673) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2019-09-07 12:53:51,160 INFO L446 ceAbstractionStarter]: At program point L655(lines 97 656) the Hoare annotation is: true [2019-09-07 12:53:51,160 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 592) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 603) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 614) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 652) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 593) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8497))) (.cse10 (<= ssl3_accept_~s__state~0 8672))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ssl3_accept_~s__hit~0 0)) .cse10) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,161 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 604) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~s__state~0 8576)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L228-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 649) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L559-2(lines 559 563) no Hoare annotation was computed. [2019-09-07 12:53:51,161 INFO L443 ceAbstractionStarter]: For program point L526-2(lines 208 585) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L659(lines 659 663) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 635) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L659-2(lines 659 663) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 625 647) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L439 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 591) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 602) no Hoare annotation was computed. [2019-09-07 12:53:51,162 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 613) no Hoare annotation was computed. [2019-09-07 12:53:51,163 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 654) the Hoare annotation is: (let ((.cse2 (= ssl3_accept_~s__state~0 8448))) (let ((.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (not (= ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8657))) (.cse8 (not (= ssl3_accept_~s__state~0 8561))) (.cse9 (not .cse2)) (.cse10 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (= 8497 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse2) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse3) (= |ssl3_accept_#in~initial_state| 8561) (<= ssl3_accept_~s__state~0 3) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3) (= 8448 |ssl3_accept_#in~initial_state|) (and .cse4 .cse5 .cse6 .cse7 (not (= ssl3_accept_~s__state~0 12292)) (<= ssl3_accept_~blastFlag~0 0) .cse8 .cse9 (not (= ssl3_accept_~s__state~0 8673)) .cse10) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-09-07 12:53:51,163 INFO L439 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,163 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 602) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (= ssl3_accept_~s__state~0 8448))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0) (and .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,163 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 615) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8672)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-09-07 12:53:51,163 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 12:53:51,163 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 632) no Hoare annotation was computed. [2019-09-07 12:53:51,163 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-09-07 12:53:51,164 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-09-07 12:53:51,164 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 590) no Hoare annotation was computed. [2019-09-07 12:53:51,164 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 601) no Hoare annotation was computed. [2019-09-07 12:53:51,164 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 612) no Hoare annotation was computed. [2019-09-07 12:53:51,164 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 623) no Hoare annotation was computed. [2019-09-07 12:53:51,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 12:53:51 BoogieIcfgContainer [2019-09-07 12:53:51,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 12:53:51,208 INFO L168 Benchmark]: Toolchain (without parser) took 27320.21 ms. Allocated memory was 139.5 MB in the beginning and 933.8 MB in the end (delta: 794.3 MB). Free memory was 86.7 MB in the beginning and 325.8 MB in the end (delta: -239.1 MB). Peak memory consumption was 806.3 MB. Max. memory is 7.1 GB. [2019-09-07 12:53:51,209 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 12:53:51,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.98 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 86.3 MB in the beginning and 173.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-09-07 12:53:51,210 INFO L168 Benchmark]: Boogie Preprocessor took 52.59 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 171.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-07 12:53:51,211 INFO L168 Benchmark]: RCFGBuilder took 756.54 ms. Allocated memory is still 199.8 MB. Free memory was 171.0 MB in the beginning and 122.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-09-07 12:53:51,211 INFO L168 Benchmark]: TraceAbstraction took 25982.50 ms. Allocated memory was 199.8 MB in the beginning and 933.8 MB in the end (delta: 734.0 MB). Free memory was 122.8 MB in the beginning and 325.8 MB in the end (delta: -203.1 MB). Peak memory consumption was 782.1 MB. Max. memory is 7.1 GB. [2019-09-07 12:53:51,215 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.21 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 523.98 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 86.3 MB in the beginning and 173.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.59 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 171.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 756.54 ms. Allocated memory is still 199.8 MB. Free memory was 171.0 MB in the beginning and 122.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25982.50 ms. Allocated memory was 199.8 MB in the beginning and 933.8 MB in the end (delta: 734.0 MB). Free memory was 122.8 MB in the beginning and 325.8 MB in the end (delta: -203.1 MB). Peak memory consumption was 782.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 666]: 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: 387]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (s__state <= 8576 && ((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497))) || \old(initial_state) == 8561 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || !(s__state == 8672)) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8497)) && s__state <= 8576)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((((((!(s__state == 8496) && !(s__state == 8545)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (((((((((blastFlag <= 2 && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__hit == 0)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || (((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8672)) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || ((((8672 <= s__state && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8673)) && !(s__hit == 0)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || ((8672 <= s__state && blastFlag <= 3) && !(s__state == 12292))) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (s__state <= 8576 && ((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497))) || \old(initial_state) == 8561 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || !(s__state == 8672)) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && !(s__hit == 0)) && s__state == 8448)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && s__state <= 8672) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (s__state <= 8576 && ((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8560)) && !(s__state == 8497))) || \old(initial_state) == 8561 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || (((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && blastFlag <= 0) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656))) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672)) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || s__state <= 3 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((!(s__hit == 0) && ((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(12292 == \old(initial_state))) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(8448 == \old(initial_state))) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8656)) && blastFlag <= 3) && s__state <= 8672)) || ((s__state <= 8576 && blastFlag <= 2) && ((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(12292 == \old(initial_state))) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(8448 == \old(initial_state))) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8656)) && blastFlag <= 3)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(initial_state) == 8480 || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || 8497 == \old(initial_state)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672)) || \old(initial_state) == 8561) || s__state <= 3) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8672)) || 8448 == \old(initial_state)) || (((((((((!(s__state == 8481) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && blastFlag <= 0) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8497))) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && s__state <= 8672)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 1 error locations. SAFE Result, 25.8s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 11.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5544 SDtfs, 6580 SDslu, 4502 SDs, 0 SdLazy, 4092 SolverSat, 902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2228 GetRequests, 2151 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2949occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1414 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 285 NumberOfFragments, 3121 HoareAnnotationTreeSize, 33 FomulaSimplifications, 51767 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 33 FomulaSimplificationsInter, 12889 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 7506 NumberOfCodeBlocks, 7506 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7473 ConstructedInterpolants, 0 QuantifiedInterpolants, 3179907 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3772 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 25247/25351 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...