/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-21 23:21:48,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-21 23:21:48,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-21 23:21:48,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-21 23:21:48,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-21 23:21:48,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-21 23:21:48,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-21 23:21:48,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-21 23:21:48,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-21 23:21:48,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-21 23:21:48,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-21 23:21:48,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-21 23:21:48,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-21 23:21:48,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-21 23:21:48,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-21 23:21:48,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-21 23:21:48,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-21 23:21:48,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-21 23:21:48,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-21 23:21:48,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-21 23:21:48,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-21 23:21:48,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-21 23:21:48,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-21 23:21:48,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-21 23:21:48,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-21 23:21:48,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-21 23:21:48,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-21 23:21:48,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-21 23:21:48,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-21 23:21:48,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-21 23:21:48,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-21 23:21:48,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-21 23:21:48,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-21 23:21:48,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-21 23:21:48,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-21 23:21:48,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-21 23:21:48,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-21 23:21:48,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-21 23:21:48,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-21 23:21:48,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-21 23:21:48,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-21 23:21:48,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-21 23:21:48,795 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-21 23:21:48,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-21 23:21:48,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-21 23:21:48,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-21 23:21:48,800 INFO L138 SettingsManager]: * Use SBE=true [2020-12-21 23:21:48,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-21 23:21:48,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-21 23:21:48,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-21 23:21:48,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-21 23:21:48,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-21 23:21:48,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-21 23:21:48,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-21 23:21:48,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-21 23:21:48,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-21 23:21:48,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-21 23:21:48,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-21 23:21:48,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-21 23:21:48,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-21 23:21:48,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-21 23:21:48,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-21 23:21:48,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-21 23:21:48,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-21 23:21:48,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-21 23:21:48,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-21 23:21:48,808 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-21 23:21:48,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-21 23:21:49,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-21 23:21:49,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-21 23:21:49,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-21 23:21:49,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-21 23:21:49,283 INFO L275 PluginConnector]: CDTParser initialized [2020-12-21 23:21:49,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2020-12-21 23:21:49,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eae5ce05/e2b5e8062e9b4c099e0e6e90f1215c09/FLAG721a23b92 [2020-12-21 23:21:50,212 INFO L306 CDTParser]: Found 1 translation units. [2020-12-21 23:21:50,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2020-12-21 23:21:50,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eae5ce05/e2b5e8062e9b4c099e0e6e90f1215c09/FLAG721a23b92 [2020-12-21 23:21:50,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eae5ce05/e2b5e8062e9b4c099e0e6e90f1215c09 [2020-12-21 23:21:50,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-21 23:21:50,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-21 23:21:50,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-21 23:21:50,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-21 23:21:50,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-21 23:21:50,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:21:50" (1/1) ... [2020-12-21 23:21:50,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b92897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:50, skipping insertion in model container [2020-12-21 23:21:50,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:21:50" (1/1) ... [2020-12-21 23:21:50,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-21 23:21:50,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-21 23:21:51,162 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[71313,71326] [2020-12-21 23:21:51,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-21 23:21:51,224 INFO L203 MainTranslator]: Completed pre-run [2020-12-21 23:21:51,444 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[71313,71326] [2020-12-21 23:21:51,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-21 23:21:51,499 INFO L208 MainTranslator]: Completed translation [2020-12-21 23:21:51,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51 WrapperNode [2020-12-21 23:21:51,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-21 23:21:51,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-21 23:21:51,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-21 23:21:51,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-21 23:21:51,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-21 23:21:51,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-21 23:21:51,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-21 23:21:51,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-21 23:21:51,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (1/1) ... [2020-12-21 23:21:51,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-21 23:21:51,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-21 23:21:51,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-21 23:21:51,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-21 23:21:51,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (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 [2020-12-21 23:21:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-21 23:21:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-21 23:21:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-21 23:21:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-21 23:21:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-21 23:21:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-21 23:21:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-21 23:21:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-21 23:21:51,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-21 23:21:52,145 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-21 23:21:53,226 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-21 23:21:53,226 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-21 23:21:53,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-21 23:21:53,238 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-21 23:21:53,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:21:53 BoogieIcfgContainer [2020-12-21 23:21:53,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-21 23:21:53,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-21 23:21:53,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-21 23:21:53,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-21 23:21:53,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:21:50" (1/3) ... [2020-12-21 23:21:53,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14629933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:21:53, skipping insertion in model container [2020-12-21 23:21:53,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:21:51" (2/3) ... [2020-12-21 23:21:53,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14629933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:21:53, skipping insertion in model container [2020-12-21 23:21:53,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:21:53" (3/3) ... [2020-12-21 23:21:53,250 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2020-12-21 23:21:53,257 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-21 23:21:53,262 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-21 23:21:53,283 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-21 23:21:53,312 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-21 23:21:53,313 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-21 23:21:53,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-21 23:21:53,313 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-21 23:21:53,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-21 23:21:53,313 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-21 23:21:53,314 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-21 23:21:53,314 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-21 23:21:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-21 23:21:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-21 23:21:53,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:53,345 INFO L422 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] [2020-12-21 23:21:53,346 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2020-12-21 23:21:53,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:53,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212982267] [2020-12-21 23:21:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:53,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212982267] [2020-12-21 23:21:53,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:53,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:53,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793455274] [2020-12-21 23:21:53,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:53,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:53,883 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2020-12-21 23:21:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:54,584 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2020-12-21 23:21:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:54,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-21 23:21:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:54,601 INFO L225 Difference]: With dead ends: 313 [2020-12-21 23:21:54,601 INFO L226 Difference]: Without dead ends: 158 [2020-12-21 23:21:54,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-21 23:21:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-21 23:21:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2020-12-21 23:21:54,661 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2020-12-21 23:21:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:54,662 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2020-12-21 23:21:54,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2020-12-21 23:21:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-21 23:21:54,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:54,666 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:54,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-21 23:21:54,666 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2020-12-21 23:21:54,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:54,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523017036] [2020-12-21 23:21:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:54,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523017036] [2020-12-21 23:21:54,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:54,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:54,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427200103] [2020-12-21 23:21:54,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:54,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:54,927 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2020-12-21 23:21:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:55,431 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2020-12-21 23:21:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:55,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-21 23:21:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:55,437 INFO L225 Difference]: With dead ends: 280 [2020-12-21 23:21:55,437 INFO L226 Difference]: Without dead ends: 158 [2020-12-21 23:21:55,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-21 23:21:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-21 23:21:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2020-12-21 23:21:55,472 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2020-12-21 23:21:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:55,473 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2020-12-21 23:21:55,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2020-12-21 23:21:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-21 23:21:55,476 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:55,476 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:21:55,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-21 23:21:55,476 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2020-12-21 23:21:55,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:55,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137778507] [2020-12-21 23:21:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:55,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137778507] [2020-12-21 23:21:55,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:55,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:55,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75241798] [2020-12-21 23:21:55,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:55,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:55,676 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2020-12-21 23:21:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:56,136 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2020-12-21 23:21:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:56,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-21 23:21:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:56,139 INFO L225 Difference]: With dead ends: 279 [2020-12-21 23:21:56,140 INFO L226 Difference]: Without dead ends: 157 [2020-12-21 23:21:56,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-21 23:21:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2020-12-21 23:21:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2020-12-21 23:21:56,156 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2020-12-21 23:21:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:56,157 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2020-12-21 23:21:56,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2020-12-21 23:21:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-21 23:21:56,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:56,160 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:56,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-21 23:21:56,161 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2020-12-21 23:21:56,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:56,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498475772] [2020-12-21 23:21:56,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:56,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498475772] [2020-12-21 23:21:56,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:56,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:56,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481983260] [2020-12-21 23:21:56,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:56,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:56,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:56,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:56,271 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2020-12-21 23:21:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:56,737 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2020-12-21 23:21:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:56,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-21 23:21:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:56,739 INFO L225 Difference]: With dead ends: 277 [2020-12-21 23:21:56,739 INFO L226 Difference]: Without dead ends: 155 [2020-12-21 23:21:56,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-21 23:21:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2020-12-21 23:21:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2020-12-21 23:21:56,760 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2020-12-21 23:21:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:56,761 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2020-12-21 23:21:56,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2020-12-21 23:21:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-21 23:21:56,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:56,768 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:56,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-21 23:21:56,770 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2020-12-21 23:21:56,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:56,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789706266] [2020-12-21 23:21:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:56,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789706266] [2020-12-21 23:21:56,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:56,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:56,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659237367] [2020-12-21 23:21:56,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:56,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:56,947 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2020-12-21 23:21:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:57,327 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2020-12-21 23:21:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:57,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-21 23:21:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:57,329 INFO L225 Difference]: With dead ends: 276 [2020-12-21 23:21:57,330 INFO L226 Difference]: Without dead ends: 154 [2020-12-21 23:21:57,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-21 23:21:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-21 23:21:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2020-12-21 23:21:57,338 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2020-12-21 23:21:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:57,339 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2020-12-21 23:21:57,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2020-12-21 23:21:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-21 23:21:57,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:57,340 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:21:57,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-21 23:21:57,341 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2020-12-21 23:21:57,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:57,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574703868] [2020-12-21 23:21:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:57,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574703868] [2020-12-21 23:21:57,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:57,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:57,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678019898] [2020-12-21 23:21:57,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:57,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:57,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:57,418 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2020-12-21 23:21:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:57,815 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2020-12-21 23:21:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:57,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-21 23:21:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:57,818 INFO L225 Difference]: With dead ends: 276 [2020-12-21 23:21:57,818 INFO L226 Difference]: Without dead ends: 154 [2020-12-21 23:21:57,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-21 23:21:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-21 23:21:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2020-12-21 23:21:57,841 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2020-12-21 23:21:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:57,842 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2020-12-21 23:21:57,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2020-12-21 23:21:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-21 23:21:57,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:57,849 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:21:57,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-21 23:21:57,856 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2020-12-21 23:21:57,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:57,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860758879] [2020-12-21 23:21:57,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:57,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860758879] [2020-12-21 23:21:57,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:57,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:57,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644281072] [2020-12-21 23:21:57,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:57,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:57,978 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2020-12-21 23:21:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:58,383 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2020-12-21 23:21:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:58,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-21 23:21:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:58,385 INFO L225 Difference]: With dead ends: 276 [2020-12-21 23:21:58,385 INFO L226 Difference]: Without dead ends: 154 [2020-12-21 23:21:58,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-21 23:21:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-21 23:21:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2020-12-21 23:21:58,394 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2020-12-21 23:21:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:58,395 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2020-12-21 23:21:58,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2020-12-21 23:21:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-21 23:21:58,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:58,398 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:58,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-21 23:21:58,399 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2020-12-21 23:21:58,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:58,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419011747] [2020-12-21 23:21:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:58,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419011747] [2020-12-21 23:21:58,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:58,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:58,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218937553] [2020-12-21 23:21:58,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:58,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:58,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:58,506 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2020-12-21 23:21:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:58,917 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2020-12-21 23:21:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:58,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-21 23:21:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:58,922 INFO L225 Difference]: With dead ends: 276 [2020-12-21 23:21:58,922 INFO L226 Difference]: Without dead ends: 154 [2020-12-21 23:21:58,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-21 23:21:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-21 23:21:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2020-12-21 23:21:58,928 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2020-12-21 23:21:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:58,928 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2020-12-21 23:21:58,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2020-12-21 23:21:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-21 23:21:58,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:58,929 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:58,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-21 23:21:58,930 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2020-12-21 23:21:58,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:58,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935637944] [2020-12-21 23:21:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:59,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935637944] [2020-12-21 23:21:59,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:59,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:59,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773279957] [2020-12-21 23:21:59,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:59,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:59,003 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2020-12-21 23:21:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:59,372 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2020-12-21 23:21:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:59,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-21 23:21:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:59,375 INFO L225 Difference]: With dead ends: 266 [2020-12-21 23:21:59,375 INFO L226 Difference]: Without dead ends: 144 [2020-12-21 23:21:59,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-21 23:21:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2020-12-21 23:21:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-21 23:21:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2020-12-21 23:21:59,385 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2020-12-21 23:21:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:59,388 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2020-12-21 23:21:59,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2020-12-21 23:21:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-21 23:21:59,390 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:59,390 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-21 23:21:59,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-21 23:21:59,390 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2020-12-21 23:21:59,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:59,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635759884] [2020-12-21 23:21:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:21:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:21:59,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635759884] [2020-12-21 23:21:59,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:21:59,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:21:59,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314642362] [2020-12-21 23:21:59,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:21:59,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:21:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:21:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:21:59,513 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2020-12-21 23:21:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:21:59,922 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2020-12-21 23:21:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:21:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-21 23:21:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:21:59,925 INFO L225 Difference]: With dead ends: 306 [2020-12-21 23:21:59,926 INFO L226 Difference]: Without dead ends: 184 [2020-12-21 23:21:59,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:21:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-21 23:21:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-21 23:21:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:21:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2020-12-21 23:21:59,933 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2020-12-21 23:21:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:21:59,934 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2020-12-21 23:21:59,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:21:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2020-12-21 23:21:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-21 23:21:59,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:21:59,935 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:21:59,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-21 23:21:59,936 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:21:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:21:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2020-12-21 23:21:59,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:21:59,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609887964] [2020-12-21 23:21:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:21:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:00,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609887964] [2020-12-21 23:22:00,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:00,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:00,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096934740] [2020-12-21 23:22:00,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:00,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:00,038 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2020-12-21 23:22:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:00,458 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2020-12-21 23:22:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:00,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-21 23:22:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:00,463 INFO L225 Difference]: With dead ends: 328 [2020-12-21 23:22:00,463 INFO L226 Difference]: Without dead ends: 184 [2020-12-21 23:22:00,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-21 23:22:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-21 23:22:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2020-12-21 23:22:00,472 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2020-12-21 23:22:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:00,472 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2020-12-21 23:22:00,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2020-12-21 23:22:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-21 23:22:00,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:00,473 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:00,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-21 23:22:00,474 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2020-12-21 23:22:00,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:00,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291419785] [2020-12-21 23:22:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:00,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291419785] [2020-12-21 23:22:00,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:00,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:00,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418152493] [2020-12-21 23:22:00,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:00,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:00,549 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2020-12-21 23:22:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:00,960 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2020-12-21 23:22:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:00,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-21 23:22:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:00,962 INFO L225 Difference]: With dead ends: 327 [2020-12-21 23:22:00,962 INFO L226 Difference]: Without dead ends: 183 [2020-12-21 23:22:00,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-21 23:22:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2020-12-21 23:22:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2020-12-21 23:22:00,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2020-12-21 23:22:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:00,970 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2020-12-21 23:22:00,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2020-12-21 23:22:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-21 23:22:00,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:00,971 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:00,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-21 23:22:00,971 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2020-12-21 23:22:00,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:00,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420059408] [2020-12-21 23:22:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:01,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420059408] [2020-12-21 23:22:01,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:01,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:01,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859874257] [2020-12-21 23:22:01,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:01,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:01,038 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2020-12-21 23:22:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:01,484 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2020-12-21 23:22:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:01,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-21 23:22:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:01,486 INFO L225 Difference]: With dead ends: 325 [2020-12-21 23:22:01,487 INFO L226 Difference]: Without dead ends: 181 [2020-12-21 23:22:01,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-21 23:22:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-12-21 23:22:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2020-12-21 23:22:01,494 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2020-12-21 23:22:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:01,494 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2020-12-21 23:22:01,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2020-12-21 23:22:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-21 23:22:01,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:01,496 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:01,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-21 23:22:01,496 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2020-12-21 23:22:01,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:01,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962526811] [2020-12-21 23:22:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:01,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962526811] [2020-12-21 23:22:01,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:01,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:01,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953733560] [2020-12-21 23:22:01,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:01,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:01,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:01,572 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2020-12-21 23:22:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:01,942 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2020-12-21 23:22:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:01,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-21 23:22:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:01,945 INFO L225 Difference]: With dead ends: 324 [2020-12-21 23:22:01,945 INFO L226 Difference]: Without dead ends: 180 [2020-12-21 23:22:01,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-21 23:22:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-21 23:22:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2020-12-21 23:22:01,952 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2020-12-21 23:22:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:01,953 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2020-12-21 23:22:01,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2020-12-21 23:22:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-21 23:22:01,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:01,954 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-21 23:22:01,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-21 23:22:01,955 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2020-12-21 23:22:01,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:01,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750290630] [2020-12-21 23:22:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:02,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750290630] [2020-12-21 23:22:02,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:02,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:02,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629414006] [2020-12-21 23:22:02,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:02,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:02,031 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2020-12-21 23:22:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:02,456 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2020-12-21 23:22:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:02,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-21 23:22:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:02,458 INFO L225 Difference]: With dead ends: 324 [2020-12-21 23:22:02,459 INFO L226 Difference]: Without dead ends: 180 [2020-12-21 23:22:02,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-21 23:22:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-21 23:22:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2020-12-21 23:22:02,466 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2020-12-21 23:22:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:02,466 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2020-12-21 23:22:02,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2020-12-21 23:22:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-21 23:22:02,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:02,468 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-12-21 23:22:02,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-21 23:22:02,468 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2020-12-21 23:22:02,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:02,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805403873] [2020-12-21 23:22:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:02,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805403873] [2020-12-21 23:22:02,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:02,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:02,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800518845] [2020-12-21 23:22:02,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:02,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:02,534 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2020-12-21 23:22:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:02,957 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2020-12-21 23:22:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:02,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-21 23:22:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:02,959 INFO L225 Difference]: With dead ends: 324 [2020-12-21 23:22:02,960 INFO L226 Difference]: Without dead ends: 180 [2020-12-21 23:22:02,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-21 23:22:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-21 23:22:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-12-21 23:22:02,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2020-12-21 23:22:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:02,969 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-12-21 23:22:02,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-12-21 23:22:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-21 23:22:02,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:02,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-21 23:22:02,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-21 23:22:02,972 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2020-12-21 23:22:02,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:02,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204997968] [2020-12-21 23:22:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:03,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204997968] [2020-12-21 23:22:03,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:03,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:03,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306129442] [2020-12-21 23:22:03,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:03,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:03,036 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2020-12-21 23:22:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:03,474 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2020-12-21 23:22:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:03,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-21 23:22:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:03,476 INFO L225 Difference]: With dead ends: 324 [2020-12-21 23:22:03,477 INFO L226 Difference]: Without dead ends: 180 [2020-12-21 23:22:03,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-21 23:22:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-21 23:22:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2020-12-21 23:22:03,484 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2020-12-21 23:22:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:03,484 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2020-12-21 23:22:03,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2020-12-21 23:22:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-21 23:22:03,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:03,486 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:03,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-21 23:22:03,486 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2020-12-21 23:22:03,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:03,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730851711] [2020-12-21 23:22:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-21 23:22:03,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730851711] [2020-12-21 23:22:03,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:03,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:03,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981532410] [2020-12-21 23:22:03,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:03,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:03,568 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2020-12-21 23:22:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:03,972 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2020-12-21 23:22:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:03,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-21 23:22:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:03,975 INFO L225 Difference]: With dead ends: 314 [2020-12-21 23:22:03,975 INFO L226 Difference]: Without dead ends: 170 [2020-12-21 23:22:03,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-21 23:22:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2020-12-21 23:22:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-21 23:22:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2020-12-21 23:22:03,985 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2020-12-21 23:22:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:03,985 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2020-12-21 23:22:03,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2020-12-21 23:22:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-21 23:22:03,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:03,988 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:03,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-21 23:22:03,988 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2020-12-21 23:22:03,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:03,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174966700] [2020-12-21 23:22:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:04,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174966700] [2020-12-21 23:22:04,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:04,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:04,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269609610] [2020-12-21 23:22:04,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:04,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:04,165 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2020-12-21 23:22:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:04,785 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2020-12-21 23:22:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:04,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-21 23:22:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:04,789 INFO L225 Difference]: With dead ends: 403 [2020-12-21 23:22:04,790 INFO L226 Difference]: Without dead ends: 259 [2020-12-21 23:22:04,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-21 23:22:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2020-12-21 23:22:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-21 23:22:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2020-12-21 23:22:04,800 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2020-12-21 23:22:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:04,801 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2020-12-21 23:22:04,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2020-12-21 23:22:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-21 23:22:04,802 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:04,802 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:04,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-21 23:22:04,802 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2020-12-21 23:22:04,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:04,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712949023] [2020-12-21 23:22:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:04,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712949023] [2020-12-21 23:22:04,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:04,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:04,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953951768] [2020-12-21 23:22:04,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:04,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:04,920 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2020-12-21 23:22:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:05,450 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2020-12-21 23:22:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:05,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-21 23:22:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:05,453 INFO L225 Difference]: With dead ends: 442 [2020-12-21 23:22:05,453 INFO L226 Difference]: Without dead ends: 255 [2020-12-21 23:22:05,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-21 23:22:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-21 23:22:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2020-12-21 23:22:05,461 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2020-12-21 23:22:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:05,461 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2020-12-21 23:22:05,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2020-12-21 23:22:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-21 23:22:05,462 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:05,463 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:05,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-21 23:22:05,463 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2020-12-21 23:22:05,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:05,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454293172] [2020-12-21 23:22:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:05,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454293172] [2020-12-21 23:22:05,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:05,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:05,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474365245] [2020-12-21 23:22:05,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:05,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:05,551 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2020-12-21 23:22:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:06,101 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2020-12-21 23:22:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:06,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-21 23:22:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:06,104 INFO L225 Difference]: With dead ends: 494 [2020-12-21 23:22:06,104 INFO L226 Difference]: Without dead ends: 283 [2020-12-21 23:22:06,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-21 23:22:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2020-12-21 23:22:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2020-12-21 23:22:06,112 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2020-12-21 23:22:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:06,112 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2020-12-21 23:22:06,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2020-12-21 23:22:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-21 23:22:06,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:06,114 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:06,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-21 23:22:06,115 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2020-12-21 23:22:06,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:06,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389518467] [2020-12-21 23:22:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:06,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389518467] [2020-12-21 23:22:06,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:06,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:06,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691704667] [2020-12-21 23:22:06,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:06,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:06,205 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2020-12-21 23:22:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:06,650 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2020-12-21 23:22:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:06,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-21 23:22:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:06,653 INFO L225 Difference]: With dead ends: 466 [2020-12-21 23:22:06,653 INFO L226 Difference]: Without dead ends: 255 [2020-12-21 23:22:06,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-21 23:22:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-21 23:22:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2020-12-21 23:22:06,661 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2020-12-21 23:22:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:06,662 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2020-12-21 23:22:06,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2020-12-21 23:22:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:06,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:06,663 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:06,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-21 23:22:06,664 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2020-12-21 23:22:06,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:06,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441027295] [2020-12-21 23:22:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:06,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441027295] [2020-12-21 23:22:06,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:06,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:06,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495194142] [2020-12-21 23:22:06,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:06,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:06,740 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2020-12-21 23:22:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:07,376 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2020-12-21 23:22:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:07,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-21 23:22:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:07,379 INFO L225 Difference]: With dead ends: 493 [2020-12-21 23:22:07,379 INFO L226 Difference]: Without dead ends: 282 [2020-12-21 23:22:07,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-21 23:22:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2020-12-21 23:22:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2020-12-21 23:22:07,389 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2020-12-21 23:22:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:07,389 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2020-12-21 23:22:07,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2020-12-21 23:22:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:07,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:07,391 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:07,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-21 23:22:07,392 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2020-12-21 23:22:07,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:07,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871455083] [2020-12-21 23:22:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:07,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871455083] [2020-12-21 23:22:07,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:07,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:07,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568811213] [2020-12-21 23:22:07,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:07,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:07,488 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2020-12-21 23:22:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:08,108 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2020-12-21 23:22:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:08,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-21 23:22:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:08,111 INFO L225 Difference]: With dead ends: 491 [2020-12-21 23:22:08,111 INFO L226 Difference]: Without dead ends: 280 [2020-12-21 23:22:08,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-21 23:22:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2020-12-21 23:22:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2020-12-21 23:22:08,120 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2020-12-21 23:22:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:08,121 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2020-12-21 23:22:08,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2020-12-21 23:22:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:08,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:08,122 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:08,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-21 23:22:08,123 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2020-12-21 23:22:08,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:08,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693797491] [2020-12-21 23:22:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:08,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693797491] [2020-12-21 23:22:08,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:08,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:08,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889302654] [2020-12-21 23:22:08,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:08,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:08,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:08,199 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2020-12-21 23:22:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:08,813 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2020-12-21 23:22:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:08,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-21 23:22:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:08,816 INFO L225 Difference]: With dead ends: 490 [2020-12-21 23:22:08,816 INFO L226 Difference]: Without dead ends: 279 [2020-12-21 23:22:08,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-21 23:22:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-12-21 23:22:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-21 23:22:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2020-12-21 23:22:08,825 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2020-12-21 23:22:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:08,826 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2020-12-21 23:22:08,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2020-12-21 23:22:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:08,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:08,828 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:08,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-21 23:22:08,828 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2020-12-21 23:22:08,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:08,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256751166] [2020-12-21 23:22:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-21 23:22:08,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256751166] [2020-12-21 23:22:08,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:08,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-21 23:22:08,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344276363] [2020-12-21 23:22:08,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-21 23:22:08,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-21 23:22:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:08,941 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2020-12-21 23:22:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:09,592 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2020-12-21 23:22:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-21 23:22:09,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-21 23:22:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:09,594 INFO L225 Difference]: With dead ends: 462 [2020-12-21 23:22:09,594 INFO L226 Difference]: Without dead ends: 251 [2020-12-21 23:22:09,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-21 23:22:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-21 23:22:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2020-12-21 23:22:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2020-12-21 23:22:09,604 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2020-12-21 23:22:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:09,604 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2020-12-21 23:22:09,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-21 23:22:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2020-12-21 23:22:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:09,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:09,606 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:09,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-21 23:22:09,606 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2020-12-21 23:22:09,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:09,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913221018] [2020-12-21 23:22:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:09,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913221018] [2020-12-21 23:22:09,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:09,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:09,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516789461] [2020-12-21 23:22:09,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:09,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:09,682 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2020-12-21 23:22:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:10,114 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2020-12-21 23:22:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:10,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-21 23:22:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:10,117 INFO L225 Difference]: With dead ends: 503 [2020-12-21 23:22:10,117 INFO L226 Difference]: Without dead ends: 272 [2020-12-21 23:22:10,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-21 23:22:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-12-21 23:22:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2020-12-21 23:22:10,128 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2020-12-21 23:22:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:10,128 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2020-12-21 23:22:10,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2020-12-21 23:22:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-21 23:22:10,130 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:10,130 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:10,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-21 23:22:10,130 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2020-12-21 23:22:10,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:10,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454705682] [2020-12-21 23:22:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:10,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454705682] [2020-12-21 23:22:10,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:10,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:10,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619817999] [2020-12-21 23:22:10,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:10,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:10,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:10,235 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2020-12-21 23:22:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:10,671 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2020-12-21 23:22:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:10,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-21 23:22:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:10,674 INFO L225 Difference]: With dead ends: 502 [2020-12-21 23:22:10,674 INFO L226 Difference]: Without dead ends: 271 [2020-12-21 23:22:10,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-21 23:22:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-21 23:22:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2020-12-21 23:22:10,684 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2020-12-21 23:22:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:10,684 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2020-12-21 23:22:10,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2020-12-21 23:22:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-21 23:22:10,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:10,686 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:10,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-21 23:22:10,686 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:10,687 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2020-12-21 23:22:10,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:10,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986813570] [2020-12-21 23:22:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:10,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986813570] [2020-12-21 23:22:10,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:10,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:10,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297423179] [2020-12-21 23:22:10,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:10,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:10,758 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2020-12-21 23:22:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:11,309 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2020-12-21 23:22:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:11,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-21 23:22:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:11,313 INFO L225 Difference]: With dead ends: 530 [2020-12-21 23:22:11,313 INFO L226 Difference]: Without dead ends: 299 [2020-12-21 23:22:11,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-21 23:22:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-21 23:22:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2020-12-21 23:22:11,326 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2020-12-21 23:22:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:11,326 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2020-12-21 23:22:11,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2020-12-21 23:22:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-21 23:22:11,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:11,328 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:11,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-21 23:22:11,328 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:11,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2020-12-21 23:22:11,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:11,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885763566] [2020-12-21 23:22:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:11,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885763566] [2020-12-21 23:22:11,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:11,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:11,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560686330] [2020-12-21 23:22:11,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:11,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:11,419 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2020-12-21 23:22:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:11,867 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2020-12-21 23:22:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:11,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-21 23:22:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:11,871 INFO L225 Difference]: With dead ends: 502 [2020-12-21 23:22:11,872 INFO L226 Difference]: Without dead ends: 271 [2020-12-21 23:22:11,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-21 23:22:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-21 23:22:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2020-12-21 23:22:11,883 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2020-12-21 23:22:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:11,883 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2020-12-21 23:22:11,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2020-12-21 23:22:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-21 23:22:11,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:11,884 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:11,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-21 23:22:11,885 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2020-12-21 23:22:11,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:11,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741056614] [2020-12-21 23:22:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:11,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741056614] [2020-12-21 23:22:11,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:11,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:11,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580417729] [2020-12-21 23:22:11,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:11,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:11,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:11,969 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2020-12-21 23:22:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:12,528 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2020-12-21 23:22:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:12,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-21 23:22:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:12,531 INFO L225 Difference]: With dead ends: 530 [2020-12-21 23:22:12,531 INFO L226 Difference]: Without dead ends: 299 [2020-12-21 23:22:12,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-21 23:22:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-21 23:22:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2020-12-21 23:22:12,542 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2020-12-21 23:22:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:12,542 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2020-12-21 23:22:12,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2020-12-21 23:22:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-21 23:22:12,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:12,544 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:12,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-21 23:22:12,544 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2020-12-21 23:22:12,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:12,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091052041] [2020-12-21 23:22:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:12,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091052041] [2020-12-21 23:22:12,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:12,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:12,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640283380] [2020-12-21 23:22:12,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:12,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:12,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:12,630 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2020-12-21 23:22:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:13,024 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2020-12-21 23:22:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-21 23:22:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:13,027 INFO L225 Difference]: With dead ends: 502 [2020-12-21 23:22:13,027 INFO L226 Difference]: Without dead ends: 271 [2020-12-21 23:22:13,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-21 23:22:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-21 23:22:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2020-12-21 23:22:13,038 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2020-12-21 23:22:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:13,038 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2020-12-21 23:22:13,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2020-12-21 23:22:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-21 23:22:13,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:13,040 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:13,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-21 23:22:13,040 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2020-12-21 23:22:13,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:13,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091125163] [2020-12-21 23:22:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:13,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091125163] [2020-12-21 23:22:13,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:13,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:13,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616036715] [2020-12-21 23:22:13,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:13,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:13,114 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2020-12-21 23:22:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:13,690 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2020-12-21 23:22:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:13,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-21 23:22:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:13,693 INFO L225 Difference]: With dead ends: 530 [2020-12-21 23:22:13,694 INFO L226 Difference]: Without dead ends: 299 [2020-12-21 23:22:13,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-21 23:22:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-21 23:22:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2020-12-21 23:22:13,705 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2020-12-21 23:22:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:13,705 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2020-12-21 23:22:13,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2020-12-21 23:22:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-21 23:22:13,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:13,707 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:13,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-21 23:22:13,707 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2020-12-21 23:22:13,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:13,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649803646] [2020-12-21 23:22:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:13,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649803646] [2020-12-21 23:22:13,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:13,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:13,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405649984] [2020-12-21 23:22:13,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:13,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:13,811 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2020-12-21 23:22:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:14,338 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2020-12-21 23:22:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:14,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-21 23:22:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:14,341 INFO L225 Difference]: With dead ends: 502 [2020-12-21 23:22:14,341 INFO L226 Difference]: Without dead ends: 271 [2020-12-21 23:22:14,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-21 23:22:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-21 23:22:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-12-21 23:22:14,352 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2020-12-21 23:22:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:14,352 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-12-21 23:22:14,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-12-21 23:22:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-21 23:22:14,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:14,354 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:14,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-21 23:22:14,354 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2020-12-21 23:22:14,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:14,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555231201] [2020-12-21 23:22:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:14,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555231201] [2020-12-21 23:22:14,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:14,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:14,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794380234] [2020-12-21 23:22:14,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:14,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:14,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:14,437 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2020-12-21 23:22:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:15,001 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2020-12-21 23:22:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:15,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-21 23:22:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:15,004 INFO L225 Difference]: With dead ends: 520 [2020-12-21 23:22:15,004 INFO L226 Difference]: Without dead ends: 289 [2020-12-21 23:22:15,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-21 23:22:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-12-21 23:22:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2020-12-21 23:22:15,019 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2020-12-21 23:22:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:15,019 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2020-12-21 23:22:15,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2020-12-21 23:22:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-21 23:22:15,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:15,021 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:15,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-21 23:22:15,021 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2020-12-21 23:22:15,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:15,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641019086] [2020-12-21 23:22:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:15,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641019086] [2020-12-21 23:22:15,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:15,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:15,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24728683] [2020-12-21 23:22:15,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:15,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:15,092 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2020-12-21 23:22:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:15,517 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2020-12-21 23:22:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:15,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-21 23:22:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:15,518 INFO L225 Difference]: With dead ends: 492 [2020-12-21 23:22:15,518 INFO L226 Difference]: Without dead ends: 261 [2020-12-21 23:22:15,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-21 23:22:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2020-12-21 23:22:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2020-12-21 23:22:15,528 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2020-12-21 23:22:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:15,528 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2020-12-21 23:22:15,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2020-12-21 23:22:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-21 23:22:15,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:15,529 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2020-12-21 23:22:15,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-21 23:22:15,530 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2020-12-21 23:22:15,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:15,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478120767] [2020-12-21 23:22:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-21 23:22:15,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478120767] [2020-12-21 23:22:15,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:15,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-21 23:22:15,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436499577] [2020-12-21 23:22:15,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-21 23:22:15,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-21 23:22:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-21 23:22:15,612 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2020-12-21 23:22:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:16,138 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2020-12-21 23:22:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-21 23:22:16,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-21 23:22:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:16,140 INFO L225 Difference]: With dead ends: 520 [2020-12-21 23:22:16,140 INFO L226 Difference]: Without dead ends: 289 [2020-12-21 23:22:16,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-21 23:22:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-21 23:22:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-12-21 23:22:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-21 23:22:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2020-12-21 23:22:16,150 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2020-12-21 23:22:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:16,150 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2020-12-21 23:22:16,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-21 23:22:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2020-12-21 23:22:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-21 23:22:16,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:16,152 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2020-12-21 23:22:16,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-21 23:22:16,152 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2020-12-21 23:22:16,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:16,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532624130] [2020-12-21 23:22:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-21 23:22:16,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532624130] [2020-12-21 23:22:16,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:16,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-21 23:22:16,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709263906] [2020-12-21 23:22:16,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-21 23:22:16,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-21 23:22:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-21 23:22:16,226 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2020-12-21 23:22:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:16,305 INFO L93 Difference]: Finished difference Result 708 states and 1057 transitions. [2020-12-21 23:22:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-21 23:22:16,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-21 23:22:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:16,309 INFO L225 Difference]: With dead ends: 708 [2020-12-21 23:22:16,309 INFO L226 Difference]: Without dead ends: 477 [2020-12-21 23:22:16,310 INFO L677 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 [2020-12-21 23:22:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-12-21 23:22:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-12-21 23:22:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-21 23:22:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 706 transitions. [2020-12-21 23:22:16,326 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 706 transitions. Word has length 106 [2020-12-21 23:22:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:16,327 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 706 transitions. [2020-12-21 23:22:16,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-21 23:22:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 706 transitions. [2020-12-21 23:22:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-21 23:22:16,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:16,329 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2020-12-21 23:22:16,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-21 23:22:16,329 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash -629836579, now seen corresponding path program 1 times [2020-12-21 23:22:16,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:16,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471217042] [2020-12-21 23:22:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-21 23:22:16,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471217042] [2020-12-21 23:22:16,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:16,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-21 23:22:16,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865681301] [2020-12-21 23:22:16,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-21 23:22:16,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:16,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-21 23:22:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-21 23:22:16,384 INFO L87 Difference]: Start difference. First operand 477 states and 706 transitions. Second operand 3 states. [2020-12-21 23:22:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:16,458 INFO L93 Difference]: Finished difference Result 962 states and 1427 transitions. [2020-12-21 23:22:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-21 23:22:16,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-21 23:22:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:16,461 INFO L225 Difference]: With dead ends: 962 [2020-12-21 23:22:16,462 INFO L226 Difference]: Without dead ends: 504 [2020-12-21 23:22:16,462 INFO L677 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 [2020-12-21 23:22:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-12-21 23:22:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2020-12-21 23:22:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-12-21 23:22:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 741 transitions. [2020-12-21 23:22:16,479 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 741 transitions. Word has length 106 [2020-12-21 23:22:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:16,480 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 741 transitions. [2020-12-21 23:22:16,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-21 23:22:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 741 transitions. [2020-12-21 23:22:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-21 23:22:16,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:16,481 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2020-12-21 23:22:16,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-21 23:22:16,482 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1216112801, now seen corresponding path program 1 times [2020-12-21 23:22:16,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:16,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281000070] [2020-12-21 23:22:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-21 23:22:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-21 23:22:16,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281000070] [2020-12-21 23:22:16,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-21 23:22:16,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-21 23:22:16,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824586946] [2020-12-21 23:22:16,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-21 23:22:16,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-21 23:22:16,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-21 23:22:16,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-21 23:22:16,550 INFO L87 Difference]: Start difference. First operand 504 states and 741 transitions. Second operand 3 states. [2020-12-21 23:22:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-21 23:22:16,576 INFO L93 Difference]: Finished difference Result 991 states and 1463 transitions. [2020-12-21 23:22:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-21 23:22:16,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-21 23:22:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-21 23:22:16,579 INFO L225 Difference]: With dead ends: 991 [2020-12-21 23:22:16,579 INFO L226 Difference]: Without dead ends: 506 [2020-12-21 23:22:16,580 INFO L677 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 [2020-12-21 23:22:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-12-21 23:22:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-12-21 23:22:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-12-21 23:22:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 743 transitions. [2020-12-21 23:22:16,598 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 743 transitions. Word has length 106 [2020-12-21 23:22:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-21 23:22:16,598 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 743 transitions. [2020-12-21 23:22:16,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-21 23:22:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 743 transitions. [2020-12-21 23:22:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-21 23:22:16,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-21 23:22:16,600 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-21 23:22:16,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-21 23:22:16,600 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-21 23:22:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-21 23:22:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2020-12-21 23:22:16,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-21 23:22:16,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736569491] [2020-12-21 23:22:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-21 23:22:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-21 23:22:16,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-21 23:22:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-21 23:22:16,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-21 23:22:16,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-21 23:22:16,896 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-21 23:22:16,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-21 23:22:17,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:22:17 BoogieIcfgContainer [2020-12-21 23:22:17,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-21 23:22:17,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-21 23:22:17,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-21 23:22:17,123 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-21 23:22:17,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:21:53" (3/4) ... [2020-12-21 23:22:17,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-21 23:22:17,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-21 23:22:17,131 INFO L168 Benchmark]: Toolchain (without parser) took 26683.58 ms. Allocated memory was 151.0 MB in the beginning and 298.8 MB in the end (delta: 147.8 MB). Free memory was 125.0 MB in the beginning and 185.3 MB in the end (delta: -60.4 MB). Peak memory consumption was 88.2 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,132 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-21 23:22:17,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1048.55 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 127.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 32.6 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.26 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 122.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,133 INFO L168 Benchmark]: Boogie Preprocessor took 90.14 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 116.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,134 INFO L168 Benchmark]: RCFGBuilder took 1480.18 ms. Allocated memory was 151.0 MB in the beginning and 203.4 MB in the end (delta: 52.4 MB). Free memory was 116.1 MB in the beginning and 159.6 MB in the end (delta: -43.5 MB). Peak memory consumption was 75.0 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,134 INFO L168 Benchmark]: TraceAbstraction took 23880.54 ms. Allocated memory was 203.4 MB in the beginning and 298.8 MB in the end (delta: 95.4 MB). Free memory was 159.1 MB in the beginning and 185.8 MB in the end (delta: -26.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 8.0 GB. [2020-12-21 23:22:17,135 INFO L168 Benchmark]: Witness Printer took 6.11 ms. Allocated memory is still 298.8 MB. Free memory was 185.8 MB in the beginning and 185.3 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-21 23:22:17,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1048.55 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 127.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 32.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 166.26 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 122.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 90.14 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 116.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1480.18 ms. Allocated memory was 151.0 MB in the beginning and 203.4 MB in the end (delta: 52.4 MB). Free memory was 116.1 MB in the beginning and 159.6 MB in the end (delta: -43.5 MB). Peak memory consumption was 75.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23880.54 ms. Allocated memory was 203.4 MB in the beginning and 298.8 MB in the end (delta: 95.4 MB). Free memory was 159.1 MB in the beginning and 185.8 MB in the end (delta: -26.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 8.0 GB. * Witness Printer took 6.11 ms. Allocated memory is still 298.8 MB. Free memory was 185.8 MB in the beginning and 185.3 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1705]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1557] EXPR s->session [L1557] EXPR s->s3 [L1557] EXPR (s->s3)->tmp.new_cipher [L1557] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1558] COND FALSE !(! tmp___9) [L1564] ret = __VERIFIER_nondet_int() [L1565] COND TRUE blastFlag == 2 [L1566] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1570] COND FALSE !(ret <= 0) [L1575] s->state = 8672 [L1576] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1577] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={6:0}] [L1705] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7515 SDtfs, 2112 SDslu, 10973 SDs, 0 SdLazy, 6885 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 763149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...